Next:
Finite State Automata and
Up:
Introduction
Previous:
Irreducible Sofic Systems
Automata Theory
Finite State Automata and Regular Languages
Minimal Deterministic Automata
FPR and FTR languages
A Polynomial Time Algorithm For Determining Whether Two Irreducible Sofic Systems With Deterministic Representations Are Equal
Natasha Jonoska
2000-05-17
