Next:
Symbolic Dynamics
Up:
Representations of Reducible Sofic
Previous:
Representations of Reducible Sofic
Introduction
Symbolic Dynamics
Subshifts of
k
-block Map
Subshifts of Finite Type, Sofic Systems and Graphs
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
Structure of a Finite Semigroup
Green's Relations
Syntactic Semigroup
Syntactic monoid of FPR and FTR languages
Natasha Jonoska
2000-05-17
