Nondeterministic right one-way jumping finite automata
From MaRDI portal
Publication:2113381
DOI10.1016/J.IC.2021.104687OpenAlexW3118644009MaRDI QIDQ2113381FDOQ2113381
Authors: Simon Beier, Markus Holzer 
Publication date: 14 March 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2021.104687
Recommendations
Cites Work
- Title not available (Why is that?)
- Petri nets and semilinear sets (extended abstract)
- Operational State Complexity under Parikh Equivalence
- Characterization and complexity results on jumping finite automata
- Jumping finite automata
- Semi-linear lattices and right one-way jumping finite automata (extended abstract)
- Operational state complexity and decidability of jumping finite automata
- Jumping finite automata: characterizations and complexity
- On basic properties of jumping finite automata
- One-way jumping finite automata
- Properties of right one-way jumping finite automata
- Properties of right one-way jumping finite automata
Cited In (7)
- Title not available (Why is that?)
- 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)
