Sweep complexity revisited

DOI10.1007/978-3-031-40247-0_8arXiv2308.06683OpenAlexW4385701058MaRDI QIDQ6199868

Robert Mercaş, Szilárd Zsolt Fazekas

Publication date: 28 February 2024

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2308.06683

zbMATH Keywords

automatadeterministicone-way jumpingsweep complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• On input-revolving deterministic and nondeterministic finite automata
• Nondeterministic right one-way jumping finite automata
• Two-head finite-state acceptors with translucent letters
• Two-way deterministic automata with jumping mode
• JUMPING FINITE AUTOMATA
• Restarting automata
• One-Way Jumping Finite Automata
• Decidability of Right One-Way Jumping Finite Automata
• Descriptional complexity of iterated uniform finite-state transducers
• Properties of right one-way jumping finite automata
• The effect of jumping modes on various automata models

This page was built for publication: Sweep complexity revisited