Nondeterministic right one-way jumping finite automata
From MaRDI portal
Publication:2113381
Recommendations
Cites work
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- Characterization and complexity results on jumping finite automata
- Jumping finite automata
- Jumping finite automata: characterizations and complexity
- On basic properties of jumping finite automata
- One-way jumping finite automata
- Operational State Complexity under Parikh Equivalence
- Operational state complexity and decidability of jumping finite automata
- Petri nets and semilinear sets (extended abstract)
- Properties of right one-way jumping finite automata
- Properties of right one-way jumping finite automata
- Semi-linear lattices and right one-way jumping finite automata (extended abstract)
Cited in
(7)- scientific article; zbMATH DE number 7584599 (Why is no real title available?)
- Non-returning deterministic and nondeterministic finite automata with translucent letters
- A survey on automata with translucent letters
- Sweep complexity revisited
- Nondeterministic right one-way jumping finite automata (extended abstract)
- Properties of right one-way jumping finite automata
- On properties of languages accepted by deterministic pushdown automata with translucent input letters
This page was built for publication: Nondeterministic right one-way jumping finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113381)