On properties of languages accepted by deterministic pushdown automata with translucent input letters

DOI10.1007/978-3-031-71112-1_15MaRDI QIDQ6666799

Carlo Mereghetti, Priscilla Raucci, Andreas Malcher, Matthias Wendlandt, Beatrice Palano, Martin Kutrib

Publication date: 20 January 2025

zbMATH Keywords

closure propertiesdeterministic pushdown automatacomputational capacityreturning and non-returning computationstranslucent input letters

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On CD-systems of stateless deterministic R-automata with window size one
• On input-revolving deterministic and nondeterministic finite automata
• Nondeterministic right one-way jumping finite automata
• Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
• CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
• JUMPING FINITE AUTOMATA
• Restarting automata
• One-Way Jumping Finite Automata
• Non-returning deterministic and nondeterministic finite automata with translucent letters
• Jump complexity of finite automata with translucent letters
• A survey on automata with translucent letters

This page was built for publication: On properties of languages accepted by deterministic pushdown automata with translucent input letters