A property of real-time trellis automata
From MaRDI portal
Publication:1079372
DOI10.1016/0166-218X(86)90025-9zbMath0597.68048MaRDI QIDQ1079372
Publication date: 1986
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(86)90025-9
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
68Q80: Cellular automata (computational aspects)
Related Items
Linear grammars with one-sided contexts and their automaton representation, Conjunctive and Boolean grammars: the true general case of the context-free grammars, Expressive power of \(\text{LL}(k)\) Boolean grammars, Linear-space recognition for grammars with contexts, On hardest languages for one-dimensional cellular automata
Cites Work