Info: Zenodo’s user support line is staffed on regular business days between Dec 23 and Jan 5. Response times may be slightly longer than normal.

Published February 28, 2002 | Version v1
Journal article Open

Descriptional Complexity of Machines with Limited Resources

  • 1. Department of Computer Science Pennsylvania State University, United States of America
  • 2. Avaya Labs, Basking Ridge, NJ, United States of America
  • 3. Department of Computer Science, New Mexico State University, United States of America
  • 4. Department of Computer Science, University of Frankfurt, Germany

Description

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.

Files

jucs_article_27853.pdf

Files (477.4 kB)

Name Size Download all
md5:72e88c9eab222a01985de745b25f0baf
477.4 kB Preview Download