scientific article
From MaRDI portal
Publication:3769982
zbMath0632.68070MaRDI QIDQ3769982
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveybibliographyD0L sequence equivalence problemformal languagemorphismPost correspondence problemEhrenfeucht conjectureEquality languages
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Semigroups in automata theory, linguistics, etc. (20M35) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (12)
On the size of independent systems of equations in semigroups ⋮ Flatwords and Post Correspondence Problem ⋮ Elementariness of a finite set of words is co-NP-complete ⋮ Prefix and equality languages of rational functions are co-context-free ⋮ Polynomial size test sets for context-free languages ⋮ New techniques for proving the decidability of equivalence problem ⋮ Large Simple Binary Equality Words ⋮ Multiplicities: A deterministic view of nondeterminism ⋮ Efficient constructions of test sets for regular and context-free languages ⋮ Equations over finite sets of words and equivalence problems in automata theory ⋮ On the size of independent systems of equations in semigroups ⋮ The equivalence problem of multitape finite automata
This page was built for publication:
