Characterization of context-free languages by erasing automata
From MaRDI portal
Recommendations
Cites work
- A generalization of context-free determinism
- scientific article; zbMATH DE number 4139727 (Why is no real title available?)
- 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 897255 (Why is no real title available?)
- scientific article; zbMATH DE number 3254906 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- The method of forced enumeration for nondeterministic automata
Cited in
(10)- Forgetting automata and contex-free languages
- An Automata-Theoretical Characterization of Context-Free Trace Languages
- A Taxonomy of Deterministic Forgetting Automata
- scientific article; zbMATH DE number 3947647 (Why is no real title available?)
- scientific article; zbMATH DE number 1275848 (Why is no real title available?)
- Machine characterization of terminal weighted eol languages
- scientific article; zbMATH DE number 897255 (Why is no real title available?)
- Erasing in context-free AFLs
- On elimination of erasing rules from E0S grammars
- Deterministic ordered restarting automata for picture languages
This page was built for publication: Characterization of context-free languages by erasing automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096842)
