WORDS GUARANTEEING MINIMUM IMAGE
From MaRDI portal
Publication:3021997
DOI10.1142/S0129054104002406zbMath1067.68116MaRDI QIDQ3021997
Jean-Eric Pin, Mikhail V. Volkov, Stuart W. Margolis
Publication date: 22 June 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054104002406
68R15: Combinatorics on words
68Q45: Formal languages and automata
20M20: Semigroups of transformations, relations, partitions, etc.
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
COLLAPSING WORDS: A PROGRESS REPORT, ON SOME PROPERTIES OF THE LANGUAGE OF 2-COLLAPSING WORDS, Semisimple Synchronizing Automata and the Wedderburn-Artin Theory, Synchronizing automata with finitely many minimal synchronizing words, Improved upper bounds on synchronizing nondeterministic automata, Collapsing words, permutation conditions and coherent colorings of trees, Image reducing words and subgroups of free groups., Synchronizing generalized monotonic automata, An algorithm for recognition of \(n\)-collapsing words, 2-Synchronizing Words, Finitely Generated Synchronizing Automata
Cites Work
- Unnamed Item
- An extremal problem for two families of sets
- Identities in full transformation semigroups
- Image reducing words and subgroups of free groups.
- Reset Sequences for Monotonic Automata
- Fast Pattern Matching in Strings
- PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY
