On properties of languages accepted by deterministic pushdown automata with translucent input letters
Open Access
- 13 March 2026
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1072
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Jump complexity of finite automata with translucent lettersTheoretical Computer Science, 2024
- Non-returning deterministic and nondeterministic finite automata with translucent lettersRAIRO - Theoretical Informatics and Applications, 2023
- Iterated uniform finite-state transducers on unary languagesTheoretical Computer Science, 2023
- Descriptional complexity of iterated uniform finite-state transducersInformation and Computation, 2022
- Nondeterministic right one-way jumping finite automataInformation and Computation, 2022
- One-Way Jumping Finite AutomataInternational Journal of Foundations of Computer Science, 2016
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automataActa Informatica, 2013
- JUMPING FINITE AUTOMATAInternational Journal of Foundations of Computer Science, 2012
- On CD-systems of stateless deterministic R-automata with window size oneJournal of Computer and System Sciences, 2012
- On input-revolving deterministic and nondeterministic finite automataInformation and Computation, 2009