Two-way deterministic automata with jumping mode

DOI10.1016/J.TCS.2021.02.030MaRDI QIDQ2661767zbMATH OpenOpenAlexFDO

Authors Szilárd Zsolt Fazekas, Kaito Hoshi, Akihiro Yamamura

Publication date 8 April 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2021.02.030

zbMATH Keywords

finite automatanonsequential processingone-way jumpingtwo-way finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• One-way jumping finite automata
• Enhancement of automata with jumping modes
• Two-dimensional jumping finite automata
• On double-jumping finite automata and their closure properties
• Characterization and complexity results on jumping finite automata

Cites work

• Decidability of right one-way jumping finite automata
• Enhancement of automata with jumping modes
• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• scientific article; zbMATH DE number 3254906 (Why is no real title available?)
• Jumping finite automata
• Nondeterministic right one-way jumping finite automata (extended abstract)
• On input-revolving deterministic and nondeterministic finite automata
• One-way jumping finite automata
• Properties of right one-way jumping finite automata
• Restarting automata

Cited in

(16)

• Nondeterministic right one-way jumping finite automata
• Enhancement of automata with jumping modes
• Two-way finite automata with a write-once track
• On double-jumping finite automata and their closure properties
• Two-dimensional jumping finite automata
• One-way jumping finite automata
• Membership problem for two-dimensional general row jumping finite automata
• Complexities for jumps and sweeps
• Jumping automata over Infinite words
• The effect of jumping modes on various automata models
• Sweep complexity revisited
• Jumping automata over infinite words
• Quantitative semantics for jumping automata
• Jumping automata must pay
• Jump complexity of deterministic finite automata with translucent letters
• On the power of real-time two-way multihead finite automata with jumps

This page was built for publication: Two-way deterministic automata with jumping mode

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