ON SOME PROPERTIES OF THE LANGUAGE OF 2-COLLAPSING WORDS

DOI10.1142/S0129054106004030zbMath1098.68078OpenAlexW2088595983MaRDI QIDQ5483378

Elena V. Pribavkina

Publication date: 14 August 2006

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054106004030

zbMATH Keywords

collapsing wordscompressible automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

An algorithm for recognition of \(n\)-collapsing words

Cites Work

• Identities in full transformation semigroups
• Image reducing words and subgroups of free groups.
• WORDS GUARANTEEING MINIMUM IMAGE
• PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY
• A helpful result for proving inherent ambiguity
• Unnamed Item

This page was built for publication: ON SOME PROPERTIES OF THE LANGUAGE OF 2-COLLAPSING WORDS