Remarks on context-free grammars with subregular control languages
Author:
Open Access
- 26 June 2024
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1010
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Conditional Lindenmayer Systems with Subregular Conditions: The Extended CaseActa Cybernetica, 2015
- Conditional Lindenmayer systems with subregular conditions: The non-extended caseRAIRO - Theoretical Informatics and Applications, 2014
- Networks of evolutionary processors: the power of subregular filtersActa Informatica, 2012
- On external contextual grammars with subregular selection languagesTheoretical Computer Science, 2012
- Determination of finite automata accepting subregular languagesTheoretical Computer Science, 2009
- Multiple-entry finite automataJournal of Computer and System Sciences, 1974
- Periodically time-variant context-free grammarsInformation and Control, 1970
- Programmed Grammars and Classes of Formal LanguagesJournal of the ACM, 1969
- Control sets on grammarsTheory of Computing Systems, 1968
- The Theory of Definite AutomataIEEE Transactions on Electronic Computers, 1963