scientific article; zbMATH DE number 7800500

arXiv2208.14730MaRDI QIDQ6190440

Benedek Nagy

Publication date: 6 February 2024

Full work available at URL: https://arxiv.org/abs/2208.14730

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On CD-systems of stateless deterministic R-automata with window size one
• Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case
• Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter
• State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata
• On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
• Two-head finite-state acceptors with translucent letters
• On the descriptional complexity of Watson-Crick automata
• A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
• On a hierarchy of 5' -> 3' sensing Watson-Crick finite automata languages
• 5′ → 3′ Watson-Crick AutomataWith Several Runs
• Linear automata with translucent letters and linear context-free trace languages
• JUMPING FINITE AUTOMATA
• Transduced-input Automata with Translucent Letters
• On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers
• On 5′→3′ Sensing Watson-Crick Finite Automata
• Developments in Language Theory
• One-Way Jumping Finite Automata
• State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata
• \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter