The ω sequence problem for DOL systems is decidable

DOI10.1145/62.2161zbMATH Open0632.68078OpenAlexW2020466367MaRDI QIDQ3769989FDOQ3769989

Authors: Karel II Culik, Tero Harju 

Publication date: 1984

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/62.2161

Recommendations

• THE D0L ω-EQUIVALENCE PROBLEM
• REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM
• The sequence equivalence problem for primitive D0L systems
• scientific article; zbMATH DE number 4045201
• An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet

zbMATH Keywords

decidabilityhomomorphismsinfinite wordsD0L systemsparallel rewriting systems\(\omega \)-equivalencelimit language equivalence

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cited In (24)

• Towards a proof of the decidability of the momentary stagnation of the growth function of D0L systems
• A bound for theω-equivalence problem of polynomial D0L systems
• Title not available (Why is that?)
• On infinite HD0L words having sparse letters
• Iterative devices generating infinite words
• The equality problem for purely substitutive words
• Title not available (Why is that?)
• HD0L \(\omega \)-equivalence and periodicity problems in the primitive case
• The language equivalence problem for HD0L systems having D0L growths
• REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM
• Title not available (Why is that?)
• Simple reductions between \(D0L\) language and sequence equivalence problems
• On D0L systems with immigration
• The equality problem for infinite words generated by primitive morphisms
• An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decidability of periodicity for infinite words
• Decidability of uniform recurrence of morphic sequences
• On infinite words generated by polynomial D0L systems
• On the subword equivalence problem for morphic words
• D0L sequence equivalence is inPfor fixed alphabets
• ON UNIFORMLY RECURRENT MORPHIC SEQUENCES
• THE D0L ω-EQUIVALENCE PROBLEM

This page was built for publication: The ω sequence problem for DOL systems is decidable

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