Generalized factorizations of words and their algorithmic properties

DOI10.1016/S0304-3975(98)00254-0zbMATH Open0933.68103WikidataQ114121085 ScholiaQ114121085MaRDI QIDQ1292486FDOQ1292486

Authors: Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter 

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1183242
• Factorizing words over an ordered alphabet
• ON LANGUAGES FACTORIZING THE FREE MONOID
• Equations in words: An algorithmic contribution

zbMATH Keywords

regular factorizationsfactorizations of words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on decidability questions on presentations of word semigroups
• The space complexity of the unique decipherability problem
• The expressibility of languages and relations by word equations

Cited In (12)

• Analysis of generating functions for special words and numbers and algorithms for computation
• Conditions for the existence of maximal factorizations
• Coding partitions of regular sets
• Efficient representation and counting of antipower factors in words
• A logic for document spanners
• Partition theorems for factorizations of ascending parameter words
• \(\alpha\)-words and factors of characteristic sequences
• Factorizing words over an ordered alphabet
• Computing equality-free string factorisations
• Positions of the ranks of factors in certain finite long length words
• Generic Algorithms for Factoring Strings
• Title not available (Why is that?)

This page was built for publication: Generalized factorizations of words and their algorithmic properties

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