𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The ultimate equivalence problem for DOL systems

✍ Scribed by Karel Culik


Publisher
Springer-Verlag
Year
1978
Tongue
English
Weight
346 KB
Volume
10
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Complete formal systems for equivalence
✍ GΓ©raud SΓ©nizergues πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 181 KB

We describe four complete and recursively enumerable formal systems S0; D0; H0; B0. Each one of them proves the decidability of some equivalence problem for some class of automata: namely the language equivalence problem for simple automata, the language equivalence problem for deterministic pushdow