Two-way finite automata with translucent input letters
From MaRDI portal
Cites work
- A survey on automata with translucent letters
- Boolean language operations on nondeterministic automata with a pushdown of constant height
- CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
- Descriptional complexity of two-way pushdown automata with restricted head reversals
- Deterministic pushdown automata with translucent input letters
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
- Finite automata with sets of translucent words
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3568031 (Why is no real title available?)
- scientific article; zbMATH DE number 2040896 (Why is no real title available?)
- Iterated uniform finite-state transducers on unary languages
- Linear automata with translucent letters and linear context-free trace languages
- Lower bounds on the size of sweeping automata
- Non-returning deterministic and nondeterministic finite automata with translucent letters
- Nondeterminism and the size of two way 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
- Quantum automata for some multiperiodic languages
- Queue automata of constant length
- Removing nondeterminism in constant height pushdown automata
- Restarting automata
- Restarting automata. The standard type of restarting automaton and its variants
- Two-head finite-state acceptors with translucent letters
This page was built for publication: Two-way finite automata with translucent input letters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884655)
