On one language with connection to determinism and bounded deleting
Acta Mathematica et Informatica Universitatis Ostraviensis (2000)
- Volume: 08, Issue: 1, page 111-121
- ISSN: 1804-1388
Access Full Article
topHow to cite
topReferences
top- Chomsky N., Linguistics, Logic, Psychology, and Computers;, Computer Programming and Artificial Inteligence (an intensive course for practical scientists and engineers), Summer session, University of Michigan, 1958, pp. 424-454. (1958)
- Chomsky N., Formal Properties of Grammars;, Handbook of Mathematical Psychology, 2, New York, Wiley, 1963, pp. 323-418. (1963) Zbl0156.25303
- Jančar P., Mráz F., Plátek M., Vogel J., Restarting Automata;, Proc. FCT'95, Dresden, Germany, LNCS 965, Springer 1995, pp. 283-292. (1995) MR1459184
- Jančar P., Mráz F., Plátek M., Procházka M., Vogel J., Restarting Automata, Marcus Grammars and Context-Free Languages;, in: Dassow J., Rozenberg G., Salomaa A. (eds.): Developments in Language Theory II; World Scientific Publ., 1996, pp 102-111. (1996) MR1466191
- Jančar P., Mráz F., Plátek M., Procházka M., Vogel J., Deleting Automata with Restart Operation;, Proc. of the Згd International Conference Development in Language Theory, Thessaloniki, July-26 1997, edited by Symeon Bozapalidis, Aristotle University of Thessaloniki, pp. 191-202. (1997)