EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 11 / No 1 (1977) RAIRO. Inform. théor., 11 1 (1977) 29-51 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 11, Number 1, 1977
Page(s) 29 - 51
DOI https://doi.org/10.1051/ita/1977110100291
Published online 01 February 2017
  1. 1. B. S. BAKER et R. V. BOOK, Reversal-Bounded Multipushdown Machines, J. Comp. Syst. Sc., vol. 8, 1974, p. 315-332. [MR: 375844] [Zbl: 0309.68043] [Google Scholar]
  2. 2. J. BERSTEL, Une hiérarchie des parties rationnelles de N2, Math. Systems Theory, vol. 7, 1973, p. 114-137. [MR: 331872] [Zbl: 0257.68078] [Google Scholar]
  3. 3. J. BERSTEL et L. BOASSON, Une suite décroissante de cônes rationnels, Institut de Programmation, Paris, n° I. P. 74-75, 1974. [Zbl: 0288.68037] [MR: 451876] [Google Scholar]
  4. 4. L. BOASSON, Two Iteration Theorems for Some Families of Languages, J. Comp. Syst. Sc., vol. 7, 1973, p. 583-596. [MR: 386352] [Zbl: 0298.68053] [Google Scholar]
  5. 5. L. BOASSON et M. NIVAT, Sur diverses familles de langages fermées par transduction rationnelle, Acta Informatica, vol. 2, 1973, p. 180-188. [MR: 331873] [Zbl: 0242.68037] [Google Scholar]
  6. 6. R. V. BOOK et S. A. GREIBACH, Quasi-Realtime Languages, Math. Systems Theory, vol. 4, 1970, p. 97-111. [MR: 276019] [Zbl: 0188.33102] [Google Scholar]
  7. 7. R. V. BOOK, M. NIVAT et M. PATERSON, Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines, Proceedings of 6th annual A.C.M. Symphosium on theory of Computing, 1974, p. 290-296. [Zbl: 0361.68105] [Google Scholar]
  8. 8. J. L. DURIEUX, Sur l'image, par une transduction rationnelle, des mots sur une lettre, R.A.I.R.O., R-2, 1975, p. 25-37. [EuDML: 92018] [MR: 395348] [Google Scholar]
  9. 9. S. EILENBERG, Communication au Congrès international des Mathématiciens, Nice, 1970. [Google Scholar]
  10. 10. S. EILENBERG et M. P. SCHUTZENBERGER, Rational Sets in Commutative Monoids, J. Algebra, vol. 13, 1969, p. 173-191. [MR: 246985] [Zbl: 0206.02703] [Google Scholar]
  11. 11. M. J. FISCHER et A. L. ROSENBERG, Real-Time Solutions of the Origin-Crossing Problem, Math. Systems theory, vol. 2, 1968, p. 257-263. [MR: 235931] [Zbl: 0181.01601] [Google Scholar]
  12. 12. S. GINSBURG, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966. [MR: 211815] [Zbl: 0184.28401] [Google Scholar]
  13. 13. S. GINSBURG, Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland Publishing Company, 1975. [MR: 443446] [Zbl: 0325.68002] [Google Scholar]
  14. 14. S. GINSBURG et J. GOLDSTINE, Intersection-Closed Full AFL and the Recursively Enumerable Languages, Information and Control, vol. 22, 1973, p. 201-231. [MR: 327087] [Zbl: 0267.68035] [Google Scholar]
  15. 15. S. GINSBURG et S. A. GREIBACH, Studies in Abstract Families of Languages, Memoirs of the Amer. Math. Soc., vol. 113, 1966, p. 285-396. [Google Scholar]
  16. 16. S. GINSBURG et S. A. GREIBACH, Principal AFL, J. Comp. Syst. Sc., vol. 4, 1970, p. 308-338. [MR: 286599] [Zbl: 0198.03102] [Google Scholar]
  17. 17. S. GINSBURG et S. A. GREIBACH, Multitape AFA, J. A.C.M., vol. 19, 1972, p. 193-221. [MR: 300828] [Zbl: 0241.68031] [Google Scholar]
  18. 18. S. GINSBURG et E. M. SPANIER, Bounded Algol-like Languages, Trans. Amer. Math. Soc., vol. 113, 1964, p. 333-368. [MR: 181500] [Zbl: 0142.24803] [Google Scholar]
  19. 19. S. GINSBURG et E. M. SPANIER, AFL with the Semilinear Property, J. Comp. Syst. Sc., vol. 5, 1971, p. 365-396. [MR: 339558] [Zbl: 0235.68029] [Google Scholar]
  20. 20. J. GOLDSTINE, Substitution and Bounded Languages, J. Comp. Syst. Sc., vol. 6, 1972, p. 9-29. [MR: 309367] [Zbl: 0232.68030] [Google Scholar]
  21. 21. S. A. GREIBACH, Chains of Full AFL's, Math. Systems theory, vol. 4, 1970, p. 231-242. [MR: 329324] [Zbl: 0203.30102] [Google Scholar]
  22. 22. S. A. GREIBACH, Simple Syntactic Operators on Full Semi-AFL's, J. Comp. Syst. Sc., vol. 6, 1972, p. 30-76. [MR: 307535] [Zbl: 0269.68046] [Google Scholar]
  23. 23. S. A. GREIBACH, One Counter Language and the IRS Condition, J. Comp. Syst. Sc., vol. 10, 1975, p. 237-247. [MR: 395352] [Zbl: 0307.68062] [Google Scholar]
  24. 24. R. ITO, Every Semilinear Set is a Finite Union of Disjoint Linear Sets, J. Comp. Syst. Sc., vol. 3, 1969, p. 221-231. [MR: 242851] [Zbl: 0187.28503] [Google Scholar]
  25. 25. M. LATTEUX, Sur les semilinéaires-langages bornés, Publication n° 60 du Laboratoire de Calcul de l'Université de Lille I, 1975. [Google Scholar]
  26. 26. L. Y. LIU et P. WEINER, A Characterization of Semilinear Sets, J. Comp. Syst. Sc., vol. 4, 1970, p. 399-307. [MR: 269448] [Zbl: 0231.68025] [Google Scholar]
  27. 27. L. Y. LIU et P. WEINER, An Infinite Hierarchy of Intersections of Context-Free Languages, Math. System Theory, vol. 7, 1973, p. 185-192. [MR: 321366] [Zbl: 0257.68077] [Google Scholar]
  28. 28. M. NIVAT, Transduction des langages de Chomsky, Ann. Inst. Fourier, Grenoble, vol. 18, 1968, p. 339-455. [EuDML: 73950] [MR: 238633] [Zbl: 0313.68065] [Google Scholar]
  29. 29. R. J. PARIKH, Language Generating Devices, M.I.T. Res. Lab. Electron. Quart. Prog. Rept., vol. 60, 1961, p. 199-212. [Google Scholar]
  30. 30. B. ROVAN, Proving Containment of Bounded AFL, J. Comp. Syst. Sc., vol. 11, 1975, p.1-55. [MR: 383850] [Zbl: 0338.68053] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.