State grammars with stores
From MaRDI portal
Recommendations
Cites work
- A hierarchy between context-free and context-sensitive languages
- Finite-Turn Pushdown Automata
- Grammatical characterizations of NPDAs and VPDAs with counters
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- Matrix grammars with a leftmost restriction
- On state-alternating context-free grammars
- On the effect of the finite index restriction on several families of grammars
- Petri net algorithms in the theory of matrix grammars
- Remarks on blind and partially blind one-way multicounter machines
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Slender matrix languages
- Some remarks on state grammars and matrix grammars
- The complexity of decision problems for finite-turn multicounter machines
- The effect of end-markers on counter machines and commutativity
Cited in
(3)
This page was built for publication: State grammars with stores
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919706)