One-Way Jumping Finite Automata

DOI10.1142/S0129054116400165zbMath1344.68116OpenAlexW2415435980MaRDI QIDQ5740533

Szilárd Zsolt Fazekas, Hiroyuki Chigahara, Akihiro Yamamura

Publication date: 27 July 2016

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054116400165

zbMATH Keywords

regular languagespumping lemmajumping finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (18)

Two-way deterministic automata with jumping mode ⋮ A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model ⋮ Unnamed Item ⋮ The effect of jumping modes on various automata models ⋮ Non-returning deterministic and nondeterministic finite automata with translucent letters ⋮ Jump complexity of finite automata with translucent letters ⋮ A survey on automata with translucent letters ⋮ Sweep complexity revisited ⋮ Freezing 1-Tag Systems with States ⋮ State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters ⋮ Unnamed Item ⋮ Properties of right one-way jumping finite automata ⋮ Enhancement of automata with jumping modes ⋮ On double-jumping finite automata and their closure properties ⋮ Membership Problem for Two-Dimensional General Row Jumping Finite Automata ⋮ Decidability of Right One-Way Jumping Finite Automata ⋮ Watson–Crick Jumping Finite Automata ⋮ Nondeterministic right one-way jumping finite automata

Cites Work

• On input-revolving deterministic and nondeterministic finite automata
• JUMPING FINITE AUTOMATA
• On Context-Free Languages
• Indexed Grammars—An Extension of Context-Free Grammars

This page was built for publication: One-Way Jumping Finite Automata