Previous |  Up |  Next

Article

Title: On one language with connection to determinism and bounded deleting (English)
Author: Procházka, Martin
Language: English
Journal: Acta Mathematica et Informatica Universitatis Ostraviensis
ISSN: 1211-4774
Volume: 8
Issue: 1
Year: 2000
Pages: 111-121
.
Category: math
.
MSC: 68Q45
idZBL: Zbl 1026.68082
idMR: MR1800227
.
Date available: 2009-01-30T09:08:24Z
Last updated: 2013-10-22
Stable URL: http://hdl.handle.net/10338.dmlcz/120554
.
Reference: [1] 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.
Reference: [2] Chomsky N.: Formal Properties of Grammars;.Handbook of Mathematical Psychology, 2, New York, Wiley, 1963, pp. 323-418. Zbl 0156.25303
Reference: [3] 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. MR 1459184
Reference: [4] 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. MR 1466191
Reference: [5] 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.
.

Files

Files Size Format View
ActaOstrav_08-2000-1_11.pdf 1.604Mb application/pdf View/Open
Back to standard record
Partner of
EuDML logo