On the decidability of some equivalence problems for DOL-systems

DOI10.1016/S0019-9958(74)90857-2zbMath0284.68065OpenAlexW1994637428MaRDI QIDQ4770506

Mogens Nielsen

Publication date: 1974

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(74)90857-2

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (18)

The equivalence problem for DF0L languages and power series. ⋮ Unnamed Item ⋮ Bounds for the D0L language equivalence problem ⋮ A new bound for the D0L language equivalence problem ⋮ The decidability of the DOL-DTOL equivalence problem ⋮ On linear systems and noncommutative rings ⋮ Simple reductions between \(D0L\) language and sequence equivalence problems ⋮ The language equivalence problem for HD0L systems having D0L growths ⋮ Easy cases of the D0L sequence equivalence problem ⋮ On the decidability of the sequence equivalence problem for DOL-systems ⋮ Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems ⋮ Problèmes decidables concernant les TOL-langages unaires ⋮ A note on DOL length sets ⋮ On the decidability of homomorphism equivalence for languages ⋮ The decidability of the FOL-DOL equivalence problem ⋮ The equivalence problem for languages defined by transductions on D0L languages ⋮ Concentration dependent OL systems ⋮ Unnamed Item

This page was built for publication: On the decidability of some equivalence problems for DOL-systems