Sweep complexity revisited

DOI10.1007/978-3-031-40247-0_8MaRDI QIDQ6199868zbMATH OpenOpenAlexFDO

Authors Szilárd Zsolt Fazekas, Robert Mercaş

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

• Complexities for jumps and sweeps
• Decidability of right one-way jumping finite automata
• Descriptional complexity of iterated uniform finite-state transducers
• Jumping finite automata
• Nondeterministic right one-way jumping finite automata
• On input-revolving deterministic and nondeterministic finite automata
• One-way jumping finite automata
• Properties of right one-way jumping finite automata
• Restarting automata
• The effect of jumping modes on various automata models
• Two-head finite-state acceptors with translucent letters
• Two-way deterministic automata with jumping mode

This page was built for publication: Sweep complexity revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199868)