Implementing WSIS via finite automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1260, Issue , 1997, Pages 50-63

  Glenn, James ^a   Gasarch, William ^a  

^a University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL ARITHMETIC; FINITE AUTOMATA;

AVERAGE CASE; COMPILER OPTIMIZATIONS; GAIN INSIGHT; POINTS OF INTEREST; PRESBURGER ARITHMETIC; RANDOM INPUT; RUNNING TIME;

OPTIMIZATION;

EID: 84863946650     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63174-7_5     Document Type: Conference Paper

References (4)

1. J.R. Bfichi. Weak second order arithmetic and finite automata. Zeitscrift fur mathematische Logic und Grundlagen der Mathematik, 6:66-92, 1960
2. J. Hopcroft. An n log n Mgorithm for minimizing states in a finite automaton. In Z. Kohavi and A. Paz, editors, Theory of Machines and Computation, pages 189-196. Academic Press, 1976.
3. A. R. Meyer. Weak monadic second order theory of successor is not elementaryrecursive. In Logic Colloquium, number 453 in Lecture Notes in Mathematics, pages 132-154. Springer-Verlag, 1974.
4. D. C. Oppen. Elementary bounds for Presburger arithmetic. In 5th A CM Symposium on Theory of Computing, pages 34-37, 1973.