Nondeterministic right one-way jumping finite automata

DOI10.1016/j.ic.2021.104687OpenAlexW3118644009MaRDI QIDQ2113381

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

Unnamed Item ⋮ Non-returning deterministic and nondeterministic finite automata with translucent letters ⋮ A survey on automata with translucent letters ⋮ Sweep complexity revisited

Cites Work

• Unnamed Item
• Semi-linear lattices and right one-way jumping finite automata (extended abstract)
• Characterization and complexity results on jumping finite automata
• Operational state complexity and decidability of jumping finite automata
• Jumping Finite Automata: Characterizations and Complexity
• Petri Nets and Semilinear Sets (Extended Abstract)
• On Basic Properties of Jumping Finite Automata
• JUMPING FINITE AUTOMATA
• Operational State Complexity under Parikh Equivalence
• One-Way Jumping Finite Automata
• Properties of right one-way jumping finite automata
• Properties of right one-way jumping finite automata

This page was built for publication: Nondeterministic right one-way jumping finite automata