scientific article

zbMath0586.68066MaRDI QIDQ3711770

Karel II Culik, Juhani Karhumäki

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

decidability

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (14)

The equivalence problem for DF0L languages and power series. ⋮ Bounds for the D0L language equivalence problem ⋮ Systems of equations over a finite set of words and automata theory ⋮ D0L sequence equivalence is inPfor fixed alphabets ⋮ Marked D0L systems and the \(2n\)-conjecture ⋮ New techniques for proving the decidability of equivalence problem ⋮ Quasi-deterministic 0L systems and their representation ⋮ Equations over finite sets of words and equivalence problems in automata theory ⋮ The language equivalence problem for HD0L systems having D0L growths ⋮ Easy cases of the D0L sequence equivalence problem ⋮ On infinite words generated by polynomial D0L systems ⋮ Streaming ranked-tree-to-string transducers ⋮ A short solution for the HDT0L sequence equivalence problem ⋮ An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet

This page was built for publication: