论文信息 - Some applications of a technique of Sakoda and Sipser

Some applications of a technique of Sakoda and Sipser

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.

B. Ravikumar | Abstract Sakoda | Sipser Sa

[1] 守屋悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[2] Oscar H. Ibarra,et al. Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation , 1989, SIAM J. Comput..

[3] Michael Sipser,et al. Lower bounds on the size of sweeping automata , 1979, J. Comput. Syst. Sci..

[4] Juris Hartmanis,et al. On the Recognition of Primes by Automata , 1968, JACM.

[5] A. R. Meyer,et al. Economy of Description by Automata, Grammars, and Formal Systems , 1971, SWAT.

[6] William J. Sakoda,et al. Nondeterminism and the size of two way finite automata , 1978, STOC.

[7] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[8] Zvi Galil,et al. A Note on Multiple-Entry Finite Automata , 1976, J. Comput. Syst. Sci..

[9] Lawrence T. Kou,et al. Multiple-Entry Finite Automata , 1974, J. Comput. Syst. Sci..