WORDS GUARANTEEING MINIMUM IMAGE
DOI10.1142/S0129054104002406zbMATH Open1067.68116OpenAlexW1992850142MaRDI QIDQ3021997FDOQ3021997
M. V. Volkov, S. W. Margolis, Jean-Éric Pin
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
Recommendations
Formal languages and automata (68Q45) Semigroups of transformations, relations, partitions, etc. (20M20) Combinatorics on words (68R15) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Title not available (Why is that?)
- Image reducing words and subgroups of free groups.
- Fast Pattern Matching in Strings
- An extremal problem for two families of sets
- Reset Sequences for Monotonic Automata
- Identities in full transformation semigroups
- PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY
Cited In (11)
- Semisimple synchronizing automata and the Wedderburn-Artin theory
- Finitely Generated Synchronizing Automata
- Improved upper bounds on synchronizing nondeterministic automata
- Collapsing words, permutation conditions and coherent colorings of trees
- Image reducing words and subgroups of free groups.
- 2-Synchronizing Words
- Synchronizing automata with finitely many minimal synchronizing words
- Synchronizing generalized monotonic automata
- An algorithm for recognition of \(n\)-collapsing words
- COLLAPSING WORDS: A PROGRESS REPORT
- ON SOME PROPERTIES OF THE LANGUAGE OF 2-COLLAPSING WORDS
This page was built for publication: WORDS GUARANTEEING MINIMUM IMAGE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3021997)
