JUMPING FINITE AUTOMATA
From MaRDI portal
Publication:4923298
DOI10.1142/S0129054112500244zbMath1283.68199MaRDI QIDQ4923298
Publication date: 6 June 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
perspectivesbasic propertiescomparison with classical finite automatadiscontinuous tape readingmodified finite automata
Related Items (38)
Jumping Grammars ⋮ Problems on finite automata and the exponential time hypothesis ⋮ Two-way deterministic automata with jumping mode ⋮ Jumping Finite Automata: Characterizations and Complexity ⋮ A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model ⋮ Jumping automata over Infinite words ⋮ Unnamed Item ⋮ The effect of jumping modes on various automata models ⋮ Simulation by Rounds of Letter-to-Letter Transducers ⋮ A hierarchy of jumping restarting automata ⋮ 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 ⋮ On the Degree of Extension of Some Models Defining Non-Regular Languages ⋮ State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Operational State Complexity and Decidability of Jumping Finite Automata ⋮ Linear automata with translucent letters and linear context-free trace languages ⋮ On Basic Properties of Jumping Finite Automata ⋮ Properties of right one-way jumping finite automata ⋮ One-Way Jumping Finite Automata ⋮ Enhancement of automata with jumping modes ⋮ Two notes on APCol systems ⋮ On double-jumping finite automata and their closure properties ⋮ Regular and linear permutation languages ⋮ A class of restricted P colonies with string environment ⋮ Two Results on Discontinuous Input Processing ⋮ Problems on Finite Automata and the Exponential Time Hypothesis ⋮ Membership Problem for Two-Dimensional General Row Jumping Finite Automata ⋮ Decidability of Right One-Way Jumping Finite Automata ⋮ Watson–Crick Jumping Finite Automata ⋮ Digging input-driven pushdown automata ⋮ Nondeterministic right one-way jumping finite automata ⋮ Characterization and complexity results on jumping finite automata
Cites Work
This page was built for publication: JUMPING FINITE AUTOMATA
