Relating the type of ambiguity of finite automata to the succinctness of their representation
SIAM Journal on Computing
On the Recognition of Primes by Automata
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Lower bounds on the size of sweeping automata
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Some comments on a recent note by Ravikumar
ACM SIGACT News
| Hi-index | 0.00 |
Sakoda and Sipser [Sa78] introduced a technique for constructing certain regular languages over a large alphabet and used these languages as candidates for proving lower bounds on the size increase when converting a nondeterministic finite automaton (NFA) to a deterministic one (DFA). The purpose of this note is to show that their method is quite useful in solving several problems in the theory of regular languages. In view of its intuitive appeal, we recommend it as a pedagogic aid for presenting lower bound proofs.