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

DOI10.1007/978-3-031-13502-6_8OpenAlexW4290017103MaRDI QIDQ2104137

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

recursionfractalscontext-free languagesinfinite state automatarailroad diagrams

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• The programming language Pascal
• Three models for the description of language
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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