EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 57 (2023) RAIRO-Theor. Inf. Appl., 57 (2023) 6 References
Open Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 57, 2023
Article Number 6
Number of page(s) 14
DOI https://doi.org/10.1051/ita/2023004
Published online 25 July 2023
  1. J. Adams, E. Freden and M. Mishna, From indexed grammars to generating functions. RAIRO-Theor. Inf. Appl. 47 (2013) 325–350. [CrossRef] [EDP Sciences] [Google Scholar]
  2. A.V. Aho, Indexed grammars –an extension of context-free grammars. J. Assoc. Comput. Mach. 15 (1968) 647–671. [CrossRef] [MathSciNet] [Google Scholar]
  3. A.V. Aho, Nested stack automata. J. Assoc. Comput. Mach. 16 (1969) 383–406. [CrossRef] [MathSciNet] [Google Scholar]
  4. P. Asveld, Controlled iteration grammars and full hyper-AFL’s. Inform Control 34 (1977) 248–269. [CrossRef] [Google Scholar]
  5. H. Bordihn and M. Holzer, On the number of active symbols in L and CD grammar systems. J. Autom. Lang. Comb. 6 (2001) 411–426. [MathSciNet] [Google Scholar]
  6. J. Cassaigne, T. Harju and J. Karhumäki, On the undecidability of freeness of matrix semigroups. Int. J. Algebra Comput. 9 (1999) 295–305. [CrossRef] [Google Scholar]
  7. L. Ciobanu, M. Elder and M. Ferov, Applications of L systems to group theory. Int. J. Algebra Comput. 28 (2018) 309–329. [CrossRef] [Google Scholar]
  8. J. Dassow and G. Vaszil, On the number of active symbols in Lindenmayer Systems. Internat. J. Found. Comput. Sci. 22 (2011), 223–235. [CrossRef] [MathSciNet] [Google Scholar]
  9. K. Čnulík, On some families of languages related to developmental systems. Int. J. Comput. Math. 4 (1974) 31–42. [CrossRef] [Google Scholar]
  10. J. Dassow, On the descriptional complexity of Lindenmayer systems. Int. J. Found. Comput. Sci. 15 (2004) 663–672. [CrossRef] [Google Scholar]
  11. M. Delest, Algebraic languages: a bridge between combinatorics and computer science, in Formal Power Series and Algebraic Combinatorics (New Brunswick , NJ 1994) DIMACS Ser. Discrete Math. Theoret. Comput. Sci., Vol. 24. American Mathematical Society, Providence RI (1996) 71–87. [CrossRef] [Google Scholar]
  12. A. Ehrenfeucht and G. Rozenberg, On ambiguity in EOL systems. Theoret. Comput. Sci. 12 (1980) 127–134. [CrossRef] [MathSciNet] [Google Scholar]
  13. A. Ehrenfeucht, G. Rozenberg and R. Verraedt, On inherently ambiguous EOL languages. Theoret. Comput. Sci. 28 (1984) 197–214. [Google Scholar]
  14. S. Ginsberg and G. Rozenberg, T0L schemes and control sets. Inform. Control 27 (1975) 109–125. [CrossRef] [Google Scholar]
  15. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Series in Computer Science. Addison-Wesley Publishing Co., Reading, Mass. (1979). [Google Scholar]
  16. W. Kuich, On the entropy of context-free languages. Inform. Control 16 (1970) 173–200. [CrossRef] [Google Scholar]
  17. L. Lipschitz and L.A. Rubel, A gap theorem for power series solutions of algebraic differential equations. Am. J. Math. 108 (1986) 1193–1213. [CrossRef] [Google Scholar]
  18. B. Mandelbrot, On recurrent noise limiting coding, Proceedings of the Symposium on Information Networks. New York, April (1954) 205–221. Polytechnic Institute of Brooklyn, Brooklyn, N.Y. (1955). [Google Scholar]
  19. G. Rozenberg and A. Salomaa, The mathematical theory of L systems. Pure and Applied Mathematics, Vol. 90. Academic Press, Inc. Harcourt Brace Jovanovich, Publishers, New York–London (1980) xvi+352. [Google Scholar]
  20. R.K. Shyamasundar and W. Kuich, The structure generating function of some families of languages. Inform. Control 32 (1976) 85–92. [CrossRef] [Google Scholar]
  21. J. Tits, Free subgroups in linear groups. J. Algebra 20 (1972) 250–270. [CrossRef] [MathSciNet] [Google Scholar]
  22. P. Tukia, Convergence groups and Gromov’s metric hyperbolic spaces. New Zealand J. Math. 23 (1994) 157–187. [MathSciNet] [Google Scholar]
  23. https://antares.sc.suu.edu/EDT0L_appendix.tar.gz [Google Scholar]
  24. P.M.B. Vitányi, Lindenmayer Systems: structure, languages, and growth functions. Mathematical Centre Tracts, Vol. 96. Mathematisch Centrum, Amsterdam (1980) vii+209. [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.