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

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

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Three models for the description of language
• An introduction to formal languages and automata.
• Title not available (Why is that?)
• The programming language Pascal
• Title not available (Why is that?)
• Title not available (Why is that?)

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)