Remarks on context-free grammars with subregular control languages
From MaRDI portal
Publication:6589853
Cites work
- scientific article; zbMATH DE number 4062631 (Why is no real title available?)
- scientific article; zbMATH DE number 50943 (Why is no real title available?)
- scientific article; zbMATH DE number 3473324 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 1836410 (Why is no real title available?)
- scientific article; zbMATH DE number 3289452 (Why is no real title available?)
- scientific article; zbMATH DE number 3293675 (Why is no real title available?)
- scientific article; zbMATH DE number 3345173 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- A survey on operational state complexity
- Conditional Lindenmayer systems with subregular conditions: the extended case
- Conditional Lindenmayer systems with subregular conditions: the non-extended case
- Conditional grammars with commutative, circular and locally testable conditions
- Control sets on grammars
- Determination of finite automata accepting subregular languages
- Grammars with control by ideals and codes
- Multiple-entry finite automata
- Networks of evolutionary processors: the power of subregular filters
- On external contextual grammars with subregular selection languages
- Periodically time-variant context-free grammars
- Programmed Grammars and Classes of Formal Languages
- The Theory of Definite Automata
This page was built for publication: Remarks on context-free grammars with subregular control languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589853)
