Control sets on context-free grammar forms
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3307584 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- A geometric hierarchy of languages
- AFL with the semilinear property
- An Infinite Hierarchy of Context-Free Languages
- Checking automata and one-way stack languages
- Context-free grammar forms
- Control sets on grammars
- Control sets on linear grammars
- Derivation-bounded languages
- Finite-Turn Pushdown Automata
- Finite-turn checking automata
- Grammar Schemata
- Left-derivation bounded languages
- Mappings which preserve context sensitive languages
- Multitape AFA
- On certain formal properties of grammars
- One way finite visit automata
- One-way stack automata
- Periodically time-variant context-free grammars
- Phrase structure languages, finite machines, and channel capacity
- Principal AFL
- Programmed Grammars and Classes of Formal Languages
- Quasi-realtime languages
- Reversal-bounded multipushdown machines
- Scattered context grammars
- Studies in abstract families of languages
- Syntactic operators on full semiAFLs
- The Unsolvability of the Recognition of Linear Context-Free Languages
Cited in
(20)- Pushdown acceptor forms
- Langages sur des alphabets infinis
- Representations of language families by homomorphic equality operations and generalized equality sets
- The OI-hierarchy is closed under control
- On languages specified by relative acceptance
- UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES
- Basic tree transducers
- Formes de langages et de grammaires
- Storage products and linear control of derivations
- One way finite visit automata
- Independance forte de certaines opérations
- Reset machines
- Tree transducers, L systems, and two-way machines
- Control sets on grammars using depth-first derivations
- Derivation languages of grammar forms†
- Iterated linear control and iterated one-turn pushdowns
- An approach to a unified theory of grammar and L forms
- Some formal results about stratificational grammars and their relevance to linguistics
- scientific article; zbMATH DE number 3602690 (Why is no real title available?)
- scientific article; zbMATH DE number 3604381 (Why is no real title available?)
This page was built for publication: Control sets on context-free grammar forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1238638)
