WORDS GUARANTEEING MINIMUM IMAGE

DOI10.1142/S0129054104002406zbMath1067.68116OpenAlexW1992850142MaRDI 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

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Semigroups of transformations, relations, partitions, etc. (20M20) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (11)

Image reducing words and subgroups of free groups. ⋮ 2-Synchronizing Words ⋮ An algorithm for recognition of \(n\)-collapsing words ⋮ Synchronizing generalized monotonic automata ⋮ Synchronizing automata with finitely many minimal synchronizing words ⋮ Improved upper bounds on synchronizing nondeterministic automata ⋮ Semisimple Synchronizing Automata and the Wedderburn-Artin Theory ⋮ Finitely Generated Synchronizing Automata ⋮ Collapsing words, permutation conditions and coherent colorings of trees ⋮ COLLAPSING WORDS: A PROGRESS REPORT ⋮ ON SOME PROPERTIES OF THE LANGUAGE OF 2-COLLAPSING WORDS

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

This page was built for publication: WORDS GUARANTEEING MINIMUM IMAGE