The following pages link to JUMPING FINITE AUTOMATA (Q4923298):
Displaying 32 items.
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- Nondeterministic right one-way jumping finite automata (Q2113381) (← links)
- Enhancement of automata with jumping modes (Q2278568) (← links)
- Two notes on APCol systems (Q2285667) (← links)
- A class of restricted P colonies with string environment (Q2311263) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- Two-way deterministic automata with jumping mode (Q2661767) (← links)
- A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model (Q2675809) (← links)
- Two Results on Discontinuous Input Processing (Q2829983) (← links)
- Problems on Finite Automata and the Exponential Time Hypothesis (Q2830210) (← links)
- Jumping Finite Automata: Characterizations and Complexity (Q2947412) (← links)
- Linear automata with translucent letters and linear context-free trace languages (Q3298123) (← links)
- Jumping Grammars (Q3455751) (← links)
- On Basic Properties of Jumping Finite Automata (Q4639928) (← links)
- (Q5016357) (← links)
- Digging input-driven pushdown automata (Q5021110) (← links)
- On double-jumping finite automata and their closure properties (Q5223615) (← links)
- Regular and linear permutation languages (Q5223617) (← links)
- Operational State Complexity and Decidability of Jumping Finite Automata (Q5384429) (← links)
- One-Way Jumping Finite Automata (Q5740533) (← links)
- Membership Problem for Two-Dimensional General Row Jumping Finite Automata (Q5859631) (← links)
- Decidability of Right One-Way Jumping Finite Automata (Q5859648) (← links)
- Watson–Crick Jumping Finite Automata (Q5859652) (← links)
- (Q5867520) (← links)
- Properties of right one-way jumping finite automata (Q5919708) (← links)
- The effect of jumping modes on various automata models (Q6155031) (← links)
- Simulation by Rounds of Letter-to-Letter Transducers (Q6178697) (← links)
- A hierarchy of jumping restarting automata (Q6180004) (← links)
- Non-returning deterministic and nondeterministic finite automata with translucent letters (Q6186539) (← links)
- Jump complexity of finite automata with translucent letters (Q6190004) (← links)
- On the Degree of Extension of Some Models Defining Non-Regular Languages (Q6204122) (← links)
- State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters (Q6204134) (← links)
