A Taxonomy of Deterministic Forgetting Automata
From MaRDI portal
Recommendations
- A taxonomy of deterministic forgetting automata
- scientific article; zbMATH DE number 1333609
- Forgetting automata and contex-free languages
- FORGETTING AUTOMATA AND UNARY LANGUAGES
- Forgetting Automata and Unary Languages
- A hierarchy of monotone deterministic non-forgetting restarting automata
- scientific article; zbMATH DE number 898049
- Deterministic forgetting planar automata are more powerful than nondeterministic finite-state planar automata
- Frequencies in forgetful timed automata
- On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone
Cites work
- Characterization of context-free languages by erasing automata
- Forgetting automata and contex-free languages
- FORGETTING AUTOMATA AND UNARY LANGUAGES
- scientific article; zbMATH DE number 3947647 (Why is no real title available?)
- scientific article; zbMATH DE number 3628417 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 1333609 (Why is no real title available?)
- scientific article; zbMATH DE number 522856 (Why is no real title available?)
- scientific article; zbMATH DE number 897255 (Why is no real title available?)
- scientific article; zbMATH DE number 898049 (Why is no real title available?)
Cited in
(6)- 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 1333609 (Why is no real title available?)
- 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 Q3533025)