A jumping 5' 3' Watson-Crick finite automata model

DOI10.1007/S00236-021-00413-XMaRDI QIDQ2675809zbMATH OpenOpenAlexFDO

Authors Radim Kocman, Zbyněk Křivka, Alexander Meduna, Benedek Nagy

Publication date 26 September 2022

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-021-00413-x

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Watson-Crick jumping finite automata
• Watson-Crick jumping finite automata
• \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter
• scientific article; zbMATH DE number 7444011
• On 5′→3′ Sensing Watson-Crick Finite Automata

Cites work

• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 7444011 (Why is no real title available?)
• Characterization and complexity results on jumping finite automata
• Decidability of right one-way jumping finite automata
• Deterministic sensing 5' 3' Watson-Crick automata without sensing parameter
• Developments in Language Theory
• Enhancement of automata with jumping modes
• Jumping finite automata
• Jumping finite automata: characterizations and complexity
• Jumping grammars
• Jumping scattered context grammars
• Linear automata with translucent letters and linear context-free trace languages
• Modern Language Models and Computation
• On 5′→3′ Sensing Watson-Crick Finite Automata
• On a hierarchy of \(5^{\prime}\rightarrow 3^{\prime}\) sensing Watson-Crick finite automata languages
• On basic properties of jumping finite automata
• On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
• On double-jumping finite automata and their closure properties
• One-way jumping finite automata
• Operational state complexity and decidability of jumping finite automata
• Regulated grammars and automata
• Scattered context grammars and their applications.
• Two-head finite-state acceptors with translucent letters
• Watson-Crick jumping finite automata

Cited in

(6)

• scientific article; zbMATH DE number 7444011 (Why is no real title available?)
• 5′ → 3′ Watson-Crick AutomataWith Several Runs
• Reversible Two-Party Computations
• State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters
• Quasi-deterministic \(5^\prime \rightarrow 3^\prime\) Watson-Crick automata
• On double-jumping finite automata and their closure properties

This page was built for publication: A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2675809)