The language equivalence problem for HD0L systems having D0L growths

DOI10.1016/J.TCS.2004.09.014zbMATH Open1078.68086OpenAlexW1982408059MaRDI QIDQ1763705FDOQ1763705

Authors: Juha Honkala 

Publication date: 22 February 2005

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.09.014

Recommendations

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

zbMATH Keywords

D0L systemHD0L systemLanguage equivalence problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• Title not available (Why is that?)
• A short solution for the HDT0L sequence equivalence problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• The decidability of the equivalence problem for DOL-systems
• Simple reductions between \(D0L\) language and sequence equivalence problems
• On the decidability of some equivalence problems for DOL-systems
• Title not available (Why is that?)
• On sentential forms of context-free grammars
• The equivalence problem for deterministic TOL-systems is undecidable
• The equivalence problem for DF0L languages and power series.
• The decidability of the DOL-DTOL equivalence problem
• The decidability of the FOL-DOL equivalence problem
• On the decidability of the OL-DOL equivalence problem
• On the Images of ℕ-Rational Sequences Counting Multiplicities
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Towards a proof of the decidability of the momentary stagnation of the growth function of D0L systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lindenmayer Systems
• The equivalence problem for languages defined by transductions on D0L languages
• On D0L and HDT0L sets in monoids

This page was built for publication: The language equivalence problem for HD0L systems having D0L growths

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