REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM

DOI10.1142/S0129054102001448zbMATH Open1066.68059OpenAlexW2066283926MaRDI QIDQ3021985FDOQ3021985

Juha Honkala

Publication date: 22 June 2005

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

Full work available at URL: https://doi.org/10.1142/s0129054102001448

Recommendations

• THE D0L ω-EQUIVALENCE PROBLEM
• The ω sequence problem for DOL systems is decidable
• scientific article; zbMATH DE number 2016846
• An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
• scientific article; zbMATH DE number 3872709

zbMATH Keywords

decidabilityD0L system\(\omega\)-equivalenceinfinite D0L word

Mathematics Subject Classification ID

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

Cites Work

• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• The decidability of the equivalence problem for DOL-systems
• On infinite words obtained by iterating morphisms
• On the decidability of the sequence equivalence problem for DOL-systems
• The ω sequence problem for DOL systems is decidable

Cited In (7)

• A bound for theω-equivalence problem of polynomial D0L systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• On infinite HD0L words having sparse letters
• The ω sequence problem for DOL systems is decidable
• Title not available (Why is that?)
• THE D0L ω-EQUIVALENCE PROBLEM

This page was built for publication: REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM

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