Descriptional Complexity of Machines with Limited Resources
Дата
Авторы
Goldstine,Jonathan
Kappes,Martin
Kintala,Chandra
Leung,Hing
Malcher,Andreas
Wotschke,Detlef
Journal Title
Journal ISSN
Volume Title
Издатель
Journal of Universal Computer Science
Аннотация
Описание
Over 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.
Ключевые слова
descriptional complexity , nondeterminism , ambiguity , formal languages , finite automata , pushdown automata , parsers , cellular automata , software reliability