scientific article
From MaRDI portal
Publication:3940867
zbMath0482.68073MaRDI QIDQ3940867
Andrzej Ehrenfeucht, Grzegorz Rozenberg
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Thue and Post systems, etc. (03D03)
Related Items (3)
A note on Post's correspondence problem ⋮ The (generalized) Post correspondence problem with lists consisting of two words is decidable ⋮ The inclusion problem for some classes of deterministic multitape automata
This page was built for publication:
