Recognition of Linear-Slender Context-Free Languages by Real Time One-Way Cellular Automata

DOI10.1007/978-3-662-47221-7_19zbMath1432.68296OpenAlexW798134576MaRDI QIDQ5500628

Véronique Terrier

Publication date: 7 August 2015

Published in: Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01442477/file/338243_1_En_19_Chapter.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Related Items (3)

Recognition of poly-slender context-free languages by trellis automata ⋮ Unambiguous conjunctive grammars over a one-symbol alphabet ⋮ Edit distance neighbourhoods of input-driven pushdown automata

This page was built for publication: Recognition of Linear-Slender Context-Free Languages by Real Time One-Way Cellular Automata