scientific article; zbMATH DE number 5593323
From MaRDI portal
Publication:5192986
DOI10.25596/JALC-2008-299zbMath1193.68156MaRDI QIDQ5192986
Publication date: 10 August 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80) Grammars and rewriting systems (68Q42)
Related Items (5)
Recognition of poly-slender context-free languages by trellis automata ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ Unambiguous conjunctive grammars over a one-symbol alphabet ⋮ Computational completeness of equations over sets of natural numbers ⋮ Linear grammars with one-sided contexts and their automaton representation
This page was built for publication:
