Minimal automaton for a factorial, transitive, and rational language
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 826075
- scientific article; zbMATH DE number 1222602
- scientific article; zbMATH DE number 4035189
- La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time)
- Deciding WQO for factorial languages
Cites work
- scientific article; zbMATH DE number 3911734 (Why is no real title available?)
- scientific article; zbMATH DE number 3911741 (Why is no real title available?)
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 4035189 (Why is no real title available?)
- scientific article; zbMATH DE number 3654376 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- Sofic systems and graphs
Cited in
(10)- The size of power automata.
- A hierarchy of shift equivalent sofic shifts
- A new algebraic invariant for weak equivalence of sofic subshifts
- THE SYNTACTIC GRAPH OF A SOFIC SHIFT IS INVARIANT UNDER SHIFT EQUIVALENCE
- Zeta Functions of Formal Languages
- CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY
- Sofic shifts with synchronizing presentations
- Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts.
- REDUCED POWER AUTOMATA AND SOFIC SYSTEMS
- A categorical invariant of flow equivalence of shifts
This page was built for publication: Minimal automaton for a factorial, transitive, and rational language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822985)
