ON SOME PROPERTIES OF THE LANGUAGE OF 2-COLLAPSING WORDS

DOI10.1142/S0129054106004030MaRDI QIDQ5483378zbMATH OpenOpenAlexFDO

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

Recommendations

• Developments in Language Theory
• Some properties on left-\((n,2)\)-languages
• On the length of shortest 2-collapsing words
• 2-collapsing words and the sequence reconstruction problem
• 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
• scientific article; zbMATH DE number 1948504
• On Some Classes of 2D Languages and Their Relations

Cites work

• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• A helpful result for proving inherent ambiguity
• Identities in full transformation semigroups
• Image reducing words and subgroups of free groups.
• PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY
• WORDS GUARANTEEING MINIMUM IMAGE

Cited in

(5)

• Image reducing words and subgroups of free groups.
• Developments in Language Theory
• COLLAPSING WORDS: A PROGRESS REPORT
• 2-collapsing words and the sequence reconstruction problem
• An algorithm for recognition of \(n\)-collapsing words

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)