Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines
Journal of the ACM (JACM)
An Introduction to Formal Languages and Automata
An Introduction to Formal Languages and Automata
Introduction to the Theory of Computation
Introduction to the Theory of Computation
The Theory of Computation
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
A necessary and sufficient pumping lemma for regular languages
ACM SIGACT News
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Finite automata and their decision problems
IBM Journal of Research and Development
Data graphs and addressing schemes
Journal of Computer and System Sciences
| Hi-index | 5.23 |
The notion of state is fundamental to the design and analysis of virtually all computational systems. The Myhill-Nerode Theorem of Finite Automata theory—and the concepts underlying the Theorem—is a source of sophisticated fundamental insights about a large class of state-based systems, both finite-state and infinite-state systems. The Theorem's elegant algebraic characterization of the notion of state often allows one to analyze the behaviors and resource requirements of such systems. This paper reviews the Theorem and illustrates its application to a variety of formal computational systems and problems, ranging from the design of circuits, to the analysis of data structures, to the study of state-based formalisms for machine-learning systems. It is hoped that this survey will awaken many to, and remind others of, the importance of the Theorem and its fundamental insights.