Input-driven languages are linear conjunctive
From MaRDI portal
Publication:2634670
DOI10.1016/j.tcs.2016.01.007zbMath1335.68127MaRDI QIDQ2634670
Publication date: 18 February 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.007
cellular automata; context-free grammars; pushdown automata; conjunctive grammars; visibly pushdown automata; trellis automata; input-driven automata
68Q45: Formal languages and automata
68Q80: Cellular automata (computational aspects)
68Q42: Grammars and rewriting systems