Pages that link to "Item:Q2947412"
From MaRDI portal
The following pages link to Jumping Finite Automata: Characterizations and Complexity (Q2947412):
Displaying 19 items.
- Nondeterministic right one-way jumping finite automata (Q2113381) (← links)
- Nondeterministic right one-way jumping finite automata (extended abstract) (Q2179327) (← links)
- Enhancement of automata with jumping modes (Q2278568) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model (Q2675809) (← links)
- Two Results on Discontinuous Input Processing (Q2829983) (← links)
- Jumping Automata for Uniform Strategies (Q2963921) (← links)
- Linear automata with translucent letters and linear context-free trace languages (Q3298123) (← links)
- Operational State Complexity and Decidability of Jumping Finite Automata (Q5384429) (← links)
- Membership Problem for Two-Dimensional General Row Jumping Finite Automata (Q5859631) (← links)
- Decidability of Right One-Way Jumping Finite Automata (Q5859648) (← links)
- (Q5867520) (← links)
- Properties of right one-way jumping finite automata (Q5896090) (← links)
- Properties of right one-way jumping finite automata (Q5919708) (← links)
- Jumping automata over Infinite words (Q6088920) (← links)
- The effect of jumping modes on various automata models (Q6155031) (← links)
- Simulation by Rounds of Letter-to-Letter Transducers (Q6178697) (← links)
- Non-returning deterministic and nondeterministic finite automata with translucent letters (Q6186539) (← links)
- Jumping automata over infinite words (Q6661761) (← links)