Minimal automaton for a factorial, transitive, and rational language

DOI10.1016/0304-3975(89)90022-4zbMath0679.68110OpenAlexW1972816315MaRDI QIDQ1822985

Danièle Beauquier

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90022-4

zbMATH Keywords

finite automatasyntactic monoids

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items

Zeta Functions of Formal Languages ⋮ Sofic shifts with synchronizing presentations ⋮ Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts. ⋮ The size of power automata. ⋮ A new algebraic invariant for weak equivalence of sofic subshifts ⋮ REDUCED POWER AUTOMATA AND SOFIC SYSTEMS ⋮ A categorical invariant of flow equivalence of shifts ⋮ THE SYNTACTIC GRAPH OF A SOFIC SHIFT IS INVARIANT UNDER SHIFT EQUIVALENCE ⋮ CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY ⋮ A hierarchy of shift equivalent sofic shifts

Cites Work

• Sofic systems and graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item