Remarks on context-free grammars with subregular control languages
From MaRDI portal
Publication:6589853
DOI10.1016/J.TCS.2024.114704MaRDI QIDQ6589853FDOQ6589853
Authors: Jürgen Dassow 
Publication date: 20 August 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiple-entry finite automata
- Determination of finite automata accepting subregular languages
- Conditional grammars with commutative, circular and locally testable conditions
- Title not available (Why is that?)
- Title not available (Why is that?)
- On external contextual grammars with subregular selection languages
- Title not available (Why is that?)
- The Theory of Definite Automata
- Control sets on grammars
- Title not available (Why is that?)
- Programmed Grammars and Classes of Formal Languages
- A survey on operational state complexity
- Title not available (Why is that?)
- Periodically time-variant context-free grammars
- Title not available (Why is that?)
- Networks of evolutionary processors: the power of subregular filters
- Conditional Lindenmayer systems with subregular conditions: the non-extended case
- Grammars with control by ideals and codes
- Conditional Lindenmayer systems with subregular conditions: the extended case
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)
