Regulated grammars under leftmost derivation

DOI10.1023/A:1009954606346zbMath0968.68082OpenAlexW1543881990MaRDI QIDQ1841063

Henning Fernau

Publication date: 22 February 2001

Published in: Grammars (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009954606346

zbMATH Keywords

bicoloured digraphsleftmost derivation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (6)

One-Sided Random Context Grammars with Leftmost Derivations ⋮ Solutions to four open problems concerning controlled pure grammar systems ⋮ Nonterminal complexity of programmed grammars. ⋮ Workspace theorems for regular-controlled grammars ⋮ On some derivation mechanisms and the complexity of their Szilard languages ⋮ On the computational completeness of generalized forbidding matrix grammars

This page was built for publication: Regulated grammars under leftmost derivation