EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 25 / No 3 (1991) RAIRO-Theor. Inf. Appl., 25 3 (1991) 255-272 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 25, Number 3, 1991
Page(s) 255 - 272
DOI https://doi.org/10.1051/ita/1991250302551
Published online 01 February 2017
  1. 1. IJ. J. AALBERSBERG and G. ROZENBERG, Theory of traces, Theoret. Comput. Sci., 1988., 60, pp. 1-82. [MR: 947532] [Zbl: 0652.68017] [Google Scholar]
  2. 2. A. V. ANISIMOV, Group languages, Kibernetika, 1971, 4, pp. 18-24. [MR: 301981] [Zbl: 0241.68034] [Google Scholar]
  3. 3. A. V. ANISIMOV and F. D. SEIFERT, Zur algebraischen Charakteristik der durch kontextfreie Sprachen definierten Gruppen, Elektr. Inf. und Kybernetik, 1975, 11, pp. 695-702. [MR: 422436] [Zbl: 0322.68047] [Google Scholar]
  4. 4. J. M. AUTEBERT, L. BOASSON and SÉNIZERGUES, Groups and NTS languages, J. Comput. Syst. Sci., 1987, 35, pp. 243-267. [MR: 910215] [Zbl: 0626.68056] [Google Scholar]
  5. 5. M. BENOIS, Parties rationnelles du groupe libre, C.R. Acad. Sci. Paris, 1969, Séries A, 269, pp. 1188-1190. [MR: 265496] [Zbl: 0214.03903] [Google Scholar]
  6. 6. J. BERSTEL, Tranductions and context-free languages, Teubner, 1979. [MR: 549481] [Zbl: 0424.68040] [Google Scholar]
  7. 7. J. BERSTEL and J. SAKAROVITCH, Recent results in the theory of rational sets, Springer L.N.C.S., 1986, 233, pp. 15-28. [MR: 874586] [Zbl: 0618.68070] [Google Scholar]
  8. 8. R. BOOK, M. JANTZEN and C. WRATHALL, Monadic Thue Systems, Theoret. Comput. Sci., 1982, 19, pp. 231-251. [MR: 671869] [Zbl: 0488.03020] [Google Scholar]
  9. 9. B. v. BRAUNMÜHL and E. HOTZEL, Supercounter machines, Springer L.N.C.S., 1979, 71, pp. 58-72. [Zbl: 0413.68047] [Google Scholar]
  10. 10. R. G. BURNS, A note on free groups, Proc. Amer. Math. Soc., 1969, 23, pp. 14-17. [MR: 252488] [Zbl: 0184.04001] [Google Scholar]
  11. 11. M. J. DUNWOODY, The accessibility of finitely presented groups, Invent. Math., 1985, 81, pp. 449-457. [EuDML: 143267] [MR: 807066] [Zbl: 0572.20025] [Google Scholar]
  12. 12. S. EILENBERG, Automata, languages, and machines, Vol. A, Academic Press, 1974. [MR: 530382] [Zbl: 0317.94045] [Google Scholar]
  13. 13. C. FROUGNY, J. SAKAROVITCH and P. SCHUPP, Finiteness conditions on subgroups and formal languages theory, Proc. London Math. Soc., 1989, 58, pp. 74-88. [MR: 969548] [Zbl: 0674.20018] [Google Scholar]
  14. 14. S. GINSBURG, The mathematical theory of context-free languages, McGraw-Hill, New York, 1966. [MR: 211815] [Zbl: 0184.28401] [Google Scholar]
  15. 15. R. H. HARING-SMITH, Groups and simple languages, Ph. D. thesis, University of Illinois, Urbana, 1981. [Zbl: 0518.20030] [MR: 2631708] [Google Scholar]
  16. 16. J. E. HOPCROFT and J. D. ULLMAN, Introduction to automata theory, languages, and computation, Addison-Wesley, 1979. [MR: 645539] [Zbl: 0426.68001] [Google Scholar]
  17. 17. M. JANTZEN, M. KUDLEK, K. LANGE and H. PETERSEN, Dyck1-reductions of context-free languages, Springer L.N.C.S., 1987, 278, pp. 218-227. [Zbl: 0642.68134] [Google Scholar]
  18. 18. W. MAGNUS, A. KARRASS and D. SOLITAR, Combinatorial group theory, Pure and Appl. Math., XII, Interscience publishers 1966. [Zbl: 0138.25604] [Google Scholar]
  19. 19. D. E. MULLER and P. SCHUPP, Groups, the theory of ends, and context-free languages, J. Comput. System. Sci., 1983, 26, pp. 295-310. [MR: 710250] [Zbl: 0537.20011] [Google Scholar]
  20. 20. J. F. PERROT, Introduction aux monoïdes syntactiques des langages algébriques, in J.-P. CRESTIN and M. NIVAT Eds., Actes des premières journées d'informatique théorique, Bonascre 1973, E.N.S.T.A., Paris, 1978, pp. 167-222. [MR: 519795] [Zbl: 0392.20047] [Google Scholar]
  21. 21. J. SAKAROVITCH, Monoïdes syntactiques et langages algébriques, Thèse 3e cycle, Université Paris-VII, 1976. [Zbl: 0362.68108] [Google Scholar]
  22. 22. J. SAKAROVITCH, Syntaxe des langages de Chomsky, Thèse Sc. Math., Univ. Paris-VII, 1979. [Google Scholar]
  23. 23. J. SAKAROVITCH, Sur une propriété d'itération des langages algébriques déterministres, Math. Systems Theory, 1981, 14, pp. 247-288. [MR: 622155] [Zbl: 0472.68042] [Google Scholar]
  24. 24. R. E. STEARNS, A regularity test for pushdown machines, Inform. and Control, 1967, 11, pp. 323-340. [Zbl: 0155.01901] [Google Scholar]
  25. 25. L. VALIANT, Regularity and related problems for deterministic pushdown automata, J. Assoc. Comput. Math., 1975, 22, pp. 1-10. [MR: 690083] [Zbl: 0293.68046] [Google Scholar]
  26. 26. E. VALKEMA, Zur Charakterisierung formaler Sprachen durch Halbgruppen, Dissertation, Universität Kiel, 1974. [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.