Jumping finite automata
From MaRDI portal
Recommendations
Cites work
Cited in
(57)- Self-modifying finite automata: An introduction
- Problems on finite automata and the exponential time hypothesis
- Nondeterministic right one-way jumping finite automata
- Enhancement of automata with jumping modes
- Two notes on APCol systems
- A class of restricted P colonies with string environment
- Characterization and complexity results on jumping finite automata
- Two-way deterministic automata with jumping mode
- A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
- Two results on discontinuous input processing
- Problems on finite automata and the exponential time hypothesis
- Jumping finite automata: characterizations and complexity
- Jumping Automata for Uniform Strategies
- Linear automata with translucent letters and linear context-free trace languages
- Jumping grammars
- On basic properties of jumping finite automata
- On the descriptional complexity of operations on semilinear sets
- Digging input-driven pushdown automata
- On double-jumping finite automata and their closure properties
- Regular and linear permutation languages
- Operational state complexity and decidability of jumping finite automata
- One-way jumping finite automata
- Membership problem for two-dimensional general row jumping finite automata
- Decidability of right one-way jumping finite automata
- Watson-Crick jumping finite automata
- Complexities for jumps and sweeps
- Properties of right one-way jumping finite automata
- State complexity bounds for the commutative closure of group languages
- Jumping automata over Infinite words
- 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
- Non-returning finite automata with translucent letters
- Quasi-deterministic 5^ 3^ Watson-Crick automata
- 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
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
- Jumping automata over infinite words
- On properties of languages accepted by deterministic pushdown automata with translucent input letters
- Quasi-deterministic finite one-head and two-head automata
- Quantitative semantics for jumping automata
- Subsequence matching and analysis problems for automata with translucent letters
- Deterministic pushdown automata with translucent input letters
- Centralized versions of jumping finite automata
- Jumping automata must pay
- Repetitive finite automata with translucent letters
- Jump complexity of deterministic finite automata with translucent letters
- Finite automata with sets of translucent words
- Deterministic pushdown automata with translucent input letters
- On properties of languages accepted by deterministic pushdown automata with translucent input letters
- Subsequence matching and analysis problems for formal languages
- On languages of transduced-input finite automata with translucent letters
- A two-dimensional infinite hierarchy for finite automata with translucent words
This page was built for publication: Jumping finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923298)
