Descriptional and computational complexity of finite automata—A survey

Finite automata are probably best known for being equivalent to right-linear context-free grammars and, thus, for capturing the lowest level of the Chomsky-hierarchy, the family of regular languages. Over the last half century, a vast literature documenting the importance of deterministic, nondeterm...

Full description

Saved in:

Bibliographic Details
Published in:	Information and computation Vol. 209; no. 3; pp. 456 - 470
Main Authors:	Holzer, Markus, Kutrib, Martin
Format:	Journal Article Conference Proceeding
Language:	English
Published:	Amsterdam Elsevier Inc 01.03.2011 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Alternation Applied sciences Computational complexity Computer science; control theory; systems Descriptional complexity Determinism Exact sciences and technology Finite automata Miscellaneous Nondeterminism Survey Theoretical computing Determinism Descriptional complexity Survey Alternation Finite automata Nondeterminism Computational complexity Linear grammar Approximation Computer theory Language family Deterministic automaton Minimization Finite automaton Regular language Non determinism Non deterministic automaton Simulation Context free grammar
ISSN:	0890-5401, 1090-2651
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!