On properties of languages accepted by deterministic pushdown automata with translucent input letters
From MaRDI portal
Cites work
- A survey on automata with translucent letters
- Descriptional complexity of iterated uniform finite-state transducers
- Deterministic pushdown automata with translucent input letters
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3550189 (Why is no real title available?)
- scientific article; zbMATH DE number 7770052 (Why is no real title available?)
- Iterated uniform finite-state transducers on unary languages
- Jump complexity of finite automata with translucent letters
- Jumping finite automata
- Non-returning deterministic and nondeterministic finite automata with translucent letters
- Nondeterministic right one-way jumping finite automata
- On CD-systems of stateless deterministic R-automata with window size one
- On input-revolving deterministic and nondeterministic finite automata
- On properties of languages accepted by deterministic pushdown automata with translucent input letters
- One-way jumping finite automata
- Restarting automata
- Restarting automata. The standard type of restarting automaton and its variants
This page was built for publication: On properties of languages accepted by deterministic pushdown automata with translucent input letters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229627)