On pushdown CD-systems of regular grammars

DOI10.1007/978-3-031-97274-4_6MaRDI QIDQ6877488zbMATH OpenFDO

Authors Benedek Nagy

Publication date 8 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-97274-4_6

zbMATH Keywords

CD-systemscontext-free languagesfractal automatapushdown automata

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Cites work

• An Automata-Theoretical Characterization of Context-Free Trace Languages
• CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
• CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
• Fractal automata: recursion in context-free and in deterministic and linear context-free languages
• From finite automata to fractal automata -- the power of recursion
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 2150285 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 745858 (Why is no real title available?)
• On CD-systems of stateless deterministic R-automata with window size one

This page was built for publication: On pushdown CD-systems of regular grammars

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