Recognition of linear-slender context-free languages by real time one-way cellular automata

DOI10.1007/978-3-662-47221-7_19MaRDI QIDQ5500628zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On slender context-free languages
• Recognition of poly-slender context-free languages by trellis automata
• A Chomsky-Schützenberger-Stanley type characterization of the class of slender context-free languages
• scientific article; zbMATH DE number 1156871
• scientific article; zbMATH DE number 1860693

Cited in

(5)

• Edit distance neighbourhoods of input-driven pushdown automata
• Recognition of poly-slender context-free languages by trellis automata
• Linear Context Free Languages
• Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
• Unambiguous conjunctive grammars over a one-symbol alphabet

This page was built for publication: Recognition of linear-slender context-free languages by real time one-way cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500628)