Controlled pure grammar systems
From MaRDI portal
Recommendations
- Solutions to four open problems concerning controlled pure grammar systems
- scientific article; zbMATH DE number 1244205
- Grammars with control by ideals and codes
- Some power-decreasing derivation restrictions in grammar systems
- A DEFINITION OF PARIKH CONTROLLED CONTEXT-FREE GRAMMARS AND SOME PROPERTIES OF THEM
Cited in
(20)- The OI-hierarchy is closed under control
- Grammatical inference for even linear languages based on control sets
- Abstract grammars based on transductions
- On the generation of sentences with their parses by propagating regular-controlled grammars
- Monotonically controlling right linear grammars with unknown behaviors to output a target string
- Regulated pushdown automata
- Solutions to four open problems concerning controlled pure grammar systems
- Some power-decreasing derivation restrictions in grammar systems
- On grammars controlled by Parikh vectors
- scientific article; zbMATH DE number 3990893 (Why is no real title available?)
- scientific article; zbMATH DE number 4011960 (Why is no real title available?)
- scientific article; zbMATH DE number 4108176 (Why is no real title available?)
- FUNCTIONAL PRODUCTION SYSTEMS VIEWED AS GRAMMARS
- Controlled finite automata
- scientific article; zbMATH DE number 1244205 (Why is no real title available?)
- A DEFINITION OF PARIKH CONTROLLED CONTEXT-FREE GRAMMARS AND SOME PROPERTIES OF THEM
- Relations between Control Mechanisms for Sequential Grammars1
- Grammars with control by ideals and codes
- Control sets on grammars
- scientific article; zbMATH DE number 3393742 (Why is no real title available?)
This page was built for publication: Controlled pure grammar systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2816364)
