Finitely generated ideal languages and synchronizing automata
From MaRDI portal
Abstract: We study representations of ideal languages by means of strongly connected synchronizing automata. For every finitely generated ideal language L we construct such an automaton with at most 2^n states, where n is the maximal length of words in L. Our constructions are based on the De Bruijn graph.
Recommendations
- Principal ideal languages and synchronizing automata
- Regular ideal languages and synchronizing automata
- Trim Strongly Connected Synchronizing Automata and Ideal Languages
- Strongly connected synchronizing automata and the language of minimal reset words
- Representation of (left) ideal regular languages by synchronizing automata
Cited in
(11)- Strongly connected synchronizing automata and the language of minimal reset words
- Reset complexity and completely reachable automata with simple idempotents
- Groups and semigroups defined by colorings of synchronizing automata.
- Principal ideal languages and synchronizing automata
- Representation of (left) ideal regular languages by synchronizing automata
- Ideal regular languages and strongly connected synchronizing automata
- scientific article; zbMATH DE number 1261104 (Why is no real title available?)
- Trim Strongly Connected Synchronizing Automata and Ideal Languages
- Representations of regular ideals in finite automata
- Reset sink complexity of regular ideals
- The finiteness of synchronous, tabled picture languages is decidable
This page was built for publication: Finitely generated ideal languages and synchronizing automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849984)
