On AFL generators for finitely encoded AFA
From MaRDI portal
Publication:2556749
Cites work
- scientific article; zbMATH DE number 3483582 (Why is no real title available?)
- A Grammatical Characterization of One-Way Nondeterministic Stack Languages
- An Infinite Hierarchy of Context-Free Languages
- Checking automata and one-way stack languages
- Principal AFL
- Stack automata and compiling
- Turing machines with restricted memory access
Cited in
(7)
This page was built for publication: On AFL generators for finitely encoded AFA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2556749)