scientific article; zbMATH DE number 2051185

zbMATH Open1051.68117MaRDI QIDQ4453477FDOQ4453477

I. V. Petrov, D. S. Ananichev

Publication date: 7 March 2004

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2087220
• Finding short synchronizing words for prefix codes
• Developments in Language Theory
• COLLAPSING WORDS: A PROGRESS REPORT
• scientific article; zbMATH DE number 6606363
• A Combinatorial Approach to Collapsing Words
• On the length of shortest 2-collapsing words
• A lower bound for the length of the shortest carefully synchronizing words
• Approximating the minimum length of synchronizing words is hard
• Approximating the minimum length of synchronizing words is hard

zbMATH Keywords

deterministic finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Cited In (5)

• Title not available (Why is that?)
• The mirror image of the language of 2-synchronizing words
• Recognizing 3-collapsing words over a binary alphabet
• Collapsing words, permutation conditions and coherent colorings of trees
• COLLAPSING WORDS: A PROGRESS REPORT

This page was built for publication:

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