scientific article; zbMATH DE number 1738654

MaRDI QIDQ4529991zbMATH OpenFDO

Authors Juhani Karhumäki

Publication date 7 May 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2055/20550069

Mathematics Subject Classification ID

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

Recommendations

• On the combinatorics of finite words
• Machines, Computations, and Universality
• scientific article; zbMATH DE number 2150290
• scientific article; zbMATH DE number 1577991
• Algorithmic combinatorics on partial words
• Combinatorics of Finite Words and Suffix Automata
• scientific article; zbMATH DE number 1737190
• scientific article; zbMATH DE number 2155195
• Combinatorics on words and the theory of Markoff
• scientific article; zbMATH DE number 2150291

Cited in

(17)

• Conjugacy of finite biprefix codes
• Problems in combinatorics on words originating from discrete dynamical systems
• Three distance theorems and combinatorics on words
• Reduced word enumeration, complexity, and randomization
• The power of commuting with finite sets of words
• scientific article; zbMATH DE number 1589555 (Why is no real title available?)
• Conjugacy relations of prefix codes
• Automatic Theorem-Proving in Combinatorics on Words
• Computing Minimum Length Representations of Sets of Words of Uniform Length
• On Conjugacy of Languages
• Counting occurrences for a finite set of words
• scientific article; zbMATH DE number 3911726 (Why is no real title available?)
• scientific article; zbMATH DE number 2155195 (Why is no real title available?)
• Word Problems and Membership Problems on Compressed Words
• On the complexity of decidable cases of the commutation problem of languages
• Machines, Computations, and Universality
• Deciding conjugacy of a rational relation (extended abstract)

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