On lindenmayerian rational subsets of monoids
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1997)
- Volume: 31, Issue: 1, page 81-96
- ISSN: 0988-3754
Access Full Article
topHow to cite
topReferences
top- 1. J. BERSTEL, Transductions and Context-Free Languages, Teubner, Stuttgart, 1979. Zbl0424.68040MR549481
- 2. K. CULIK II, New techniques for proving the decidability of equivalence problems, in: T. Lepistö and A. Salomaa (eds.), Automata, Languages and Programming, Springer, Berlin, 1988. Zbl0662.68079MR1023634
- 3. A. EHRENFEUCHT and G. ROZENBERG, On proving that certain languages are not ETOL, Acta Inform., 1976, 6, pp. 407-415. Zbl0349.68034MR411252
- 4. G. ROZENBERG and A. SALOMAA, The Mathematical Theory of L Systems, Academic Press, New York, 1980. Zbl0508.68031MR561711