A Combinatorial Approach to Collapsing Words

DOI10.1007/11821069_23MaRDI QIDQ5756682zbMATH OpenOpenAlexFDO

Authors Paweł Gawrychowski, Brunetto Piochi, A. Cherubini, Andrzej Kisielewicz

Publication date 5 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2158/340020

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• An algorithm for recognition of \(n\)-collapsing words
• COLLAPSING WORDS: A PROGRESS REPORT
• Developments in Language Theory
• Collapsing words, permutation conditions and coherent colorings of trees
• On the length of shortest 2-collapsing words

Cited in

(12)

• Collapsing words, permutation conditions and coherent colorings of trees
• An algorithm for recognition of \(n\)-collapsing words
• Recognizing 3-collapsing words over a binary alphabet
• 2-Synchronizing Words
• On the length of shortest 2-collapsing words
• scientific article; zbMATH DE number 1948504 (Why is no real title available?)
• scientific article; zbMATH DE number 2051185 (Why is no real title available?)
• Composing short 3-compressing words on a 2-letter alphabet
• Short 3-collapsing words over a 2-letter alphabet
• Developments in Language Theory
• COLLAPSING WORDS: A PROGRESS REPORT
• ON SOME PROPERTIES OF THE LANGUAGE OF 2-COLLAPSING WORDS

This page was built for publication: A Combinatorial Approach to Collapsing Words

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