|
233
|
An n log n algorithm for minimizing states in a finite automation
– J E Hopcroft
- 1971
|
|
3376
|
Introduction to Automata Theory Languages and Computation. 2nd edition. Addison-Wesley Publishing Company, 2000. de
– J Hopcroft, J Ullman
- 2004
|
|
22
|
Weak second order arithmetic and finite automata
– J R Büchi
- 1960
|
|
247
|
Decidability of second-order theories and automata on infinite trees
– M O Rabin
- 1969
|
|
45
|
Taxonomies and Toolkits of Regular Language Algorithms
– B Watson
- 1995
|
|
31
|
Weak monadic second order theory of successor is not elementary recursive
– A R Meyer
- 1975
|
|
13
|
Efficient Approaches to Subset Construction
– Ted Leslie
- 1995
|
|
72
|
Codes and Automata
– Jean Berstel, Dominique Perrin, Christophe Reutenauer
- 2009
|
|
2172
|
The Design and Analysis of Computer Algorithms
– A V Aho, J E Hopcroft, J D Ullman
- 1974
|
|
13
|
Elementary bounds for Presburger Arithmetic
– Derek C Oppen
- 1973
|
|
7320
|
Introduction to Algorithms
– T H Cormen, C E Leiserson, R L Rivest, C Stein
- 2001
|
|
42
|
On Some Applications of Finite-State Automata Theory to Natural Language Processing
– Mehryar Mohri
- 1996
|
|
3
|
One–Level Prosodic Morphology
– Markus Walther
- 1999
|
|
19
|
Transducers from Rewrite Rules with Backreferences
– Dale Gerdemann, Gertjan van Noord
- 1999
|
|
50
|
Mona Fido: The Logic-Automaton Connection in Practice
– Nils Klarlund
- 1998
|
|
301
|
The Logic of Typed Feature Structures
– Bob Carpenter, Fernando Pereira
- 1992
|
|
35
|
Directed Replacement
– Lauri Karttunen
- 1996
|
|
53
|
The Replace Operator
– Lauri Karttunen
- 1995
|
|
75
|
Deterministic Part-of-Speech Tagging with Finite-State Transducers
– Emmanuel Roche, Yves Schabes
- 1995
|
