Descriptional Complexity of Machines with Limited Resources

dc.creatorGoldstine,Jonathan
dc.creatorKappes,Martin
dc.creatorKintala,Chandra
dc.creatorLeung,Hing
dc.creatorMalcher,Andreas
dc.creatorWotschke,Detlef
dc.date2002
dc.date.accessioned2024-02-06T12:51:39Z
dc.date.available2024-02-06T12:51:39Z
dc.descriptionOver the last 30 years or so many results have appeared on the descriptional complexity of machines with limited resources. Since these results have appeared in a variety of different contexts, our goal here is to provide a survey of these results. Particular emphasis is put on limiting resources (e.g., nondeterminism, ambiguity, lookahead, etc.) for various types of finite state machines, pushdown automata, parsers and cellular automata and on the effect it has on their descriptional complexity. We also address the question of how descriptional complexity might help in the future to solve practical issues, such as software reliability. 1.) C. S. Calude, K. Salomaa, S. Yu (eds.). Advances and Trends in Automata and Formal Languages. A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-008-02-0193
dc.identifierhttps://lib.jucs.org/article/27853/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/8105
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 8(2): 193-234
dc.subjectdescriptional complexity
dc.subjectnondeterminism
dc.subjectambiguity
dc.subjectformal languages
dc.subjectfinite automata
dc.subjectpushdown automata
dc.subjectparsers
dc.subjectcellular automata
dc.subjectsoftware reliability
dc.titleDescriptional Complexity of Machines with Limited Resources
dc.typeResearch Article
Файлы