scientific article; zbMATH DE number 4045201

MaRDI QIDQ3782819zbMATH OpenFDO

Authors Karel II Culik, Juhani Karhumäki

Publication date 1987

zbMATH Keywords

decidabilityequivalence problem

Mathematics Subject Classification ID

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

Recommendations

• The sequence equivalence problem for marked DT0L systems
• scientific article; zbMATH DE number 1512077
• The ω sequence problem for DOL systems is decidable
• On the equivalence problem of context-free and DT0L languages
• A new bound for the D0L sequence equivalence problem

Cited in

(15)

• Recurrent words and simultaneous growth in T0L systems
• Simple reductions between D0L language and sequence equivalence problems
• On images of D0L and DT0L power series.
• Decidability of EDT0L structural equivalence
• On the equivalence problem of context-free and DT0L languages
• On D0L and HDT0L sets in monoids
• Towards a proof of the decidability of the momentary stagnation of the growth function of D0L systems
• Equality sets of morphic word sequences
• The sequence equivalence problem for marked DT0L systems
• scientific article; zbMATH DE number 3940751 (Why is no real title available?)
• The ω sequence problem for DOL systems is decidable
• scientific article; zbMATH DE number 4055075 (Why is no real title available?)
• scientific article; zbMATH DE number 4058890 (Why is no real title available?)
• scientific article; zbMATH DE number 49043 (Why is no real title available?)
• New techniques for proving the decidability of equivalence problem

This page was built for publication:

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