THE EQUALITY CONDITION FOR INFINITE CATENATIONS OF TWO SETS OF FINITE WORDS

DOI10.1142/S0129054193000171zbMATH Open0802.68098MaRDI QIDQ4286113FDOQ4286113

Authors: Boris Melnikov 

Publication date: 27 April 1994

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Recommendations

• An algorithm for checking the equality of infinite catenations of finite languages
• scientific article; zbMATH DE number 992002
• Long words: The theory of concatenation and \(\omega\)-power
• Two decidability problems for infinite words
• The equality problem for infinite words generated by primitive morphisms

zbMATH Keywords

finite sets of words\(\omega\)-wordscondition for equalityinfinite catenations

Mathematics Subject Classification ID

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

This page was built for publication: THE EQUALITY CONDITION FOR INFINITE CATENATIONS OF TWO SETS OF FINITE WORDS

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