From finite automata to fractal automata -- the power of recursion

DOI10.1007/978-3-031-13502-6_8MaRDI QIDQ2104137zbMATH OpenOpenAlexFDO

Authors Benedek Nagy

Publication date 9 December 2022

Full work available at URL https://doi.org/10.1007/978-3-031-13502-6_8

zbMATH Keywords

context-free languagesfractalsrecursioninfinite state automatarailroad diagrams

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3181460 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 400623 (Why is no real title available?)
• scientific article; zbMATH DE number 1033441 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• An introduction to formal languages and automata.
• The programming language Pascal
• Three models for the description of language

Cited in

(1)

• How to Split Recursive Automata

This page was built for publication: From finite automata to fractal automata -- the power of recursion

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