Input-driven pushdown automata with translucent input letters

Cites work

A survey on automata with translucent letters
CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
Deterministic pushdown automata with translucent input letters
Deterministic pushdown automata with translucent input letters
Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
Finite automata with sets of translucent words
Globally deterministic CD-systems of stateless R-automata with window size 1
scientific article; zbMATH DE number 3885334 (Why is no real title available?)
scientific article; zbMATH DE number 3664335 (Why is no real title available?)
scientific article; zbMATH DE number 3696500 (Why is no real title available?)
scientific article; zbMATH DE number 3302285 (Why is no real title available?)
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 Context-Free Languages
On input-revolving deterministic and nondeterministic finite automata
On properties of languages accepted by deterministic pushdown automata with translucent input letters
On properties of languages accepted by deterministic pushdown automata with translucent input letters
On visibly pushdown trace languages
One-way jumping finite automata
Restarting automata
Restarting automata. The standard type of restarting automaton and its variants
Two-way finite automata with translucent input letters

This page was built for publication: Input-driven 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 Q7395626)