A taxonomy of deterministic forgetting automata
From MaRDI portal
Publication:3586407
Recommendations
Cites work
Cited in
(8)- Forgetting automata and contex-free languages
- Deterministic forgetting planar automata are more powerful than nondeterministic finite-state planar automata
- FORGETTING AUTOMATA AND UNARY LANGUAGES
- A Taxonomy of Deterministic Forgetting Automata
- scientific article; zbMATH DE number 3947647 (Why is no real title available?)
- A taxonomy of forgetting automata
- scientific article; zbMATH DE number 898049 (Why is no real title available?)
- Forgetting Automata and Unary Languages
This page was built for publication: A taxonomy of deterministic forgetting automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586407)