ON SOME PROPERTIES OF THE LANGUAGE OF 2-COLLAPSING WORDS

DOI10.1142/S0129054106004030zbMATH Open1098.68078OpenAlexW2088595983MaRDI QIDQ5483378FDOQ5483378

Elena 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)

Cites Work

• Title not available (Why is that?)
• Image reducing words and subgroups of free groups.
• WORDS GUARANTEEING MINIMUM IMAGE
• A helpful result for proving inherent ambiguity
• Identities in full transformation semigroups
• PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY

Cited In (3)

• Image reducing words and subgroups of free groups.
• An algorithm for recognition of \(n\)-collapsing words
• COLLAPSING WORDS: A PROGRESS REPORT

   Recommendations

• Developments in Language Theory 👍 👎
• Title not available (Why is that?) 👍 👎
• On the length of shortest 2-collapsing words 👍 👎
• Title not available (Why is that?) 👍 👎
• A note on identities of two-dimensional languages 👍 👎
• A Combinatorial Approach to Collapsing Words 👍 👎
• Two non-closure results on families ofL languages 👍 👎
• Classes of two-dimensional languages and recognizability conditions 👍 👎
• Title not available (Why is that?) 👍 👎
• On Some Classes of 2D Languages and Their Relations 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483378)