Results 261 to 267 of about 3,110 (267)

Two-way deterministic finite automata are exponentially more succinct than sweeping automata

Information Processing Letters, 1981
Silvio Micali
exaly  

Characterizations of 1-Way Quantum Finite Automata

SIAM Journal on Computing, 2002
Nicholas Pippenger
exaly  

On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata

IEEE Transactions on Computers, 1971
exaly  

On finite nilpotent automata

Acta Cybern., 1981
openaire   +2 more sources

Applications of finite automata representing large vocabularies

Software - Practice and Experience, 1993
exaly  

Finite Automata and the Set of Squares

Journal of the ACM, 1963
openaire   +3 more sources

Finite branching automata

Kybernetika, 1974
openaire   +2 more sources