Journal ArticleDOI
5′→3′ Watson-Crick pushdown automata
TLDR
Acceptance by empty stack and acceptance by final states are proven to have the same recognition power in this new model, which includes the class of context-free languages.About:
This article is published in Information Sciences.The article was published on 2020-10-01. It has received 5 citations till now. The article focuses on the topics: Pushdown automaton & Pumping lemma for regular languages.read more
Citations
More filters
5' → 3' Watson-Crick Automata with Several Runs.
Peter Leupold,Benedek Nagy +1 more
TL;DR: In this paper, the expressive power of 5′ → 3′ WK-automata increases with every additional run that they can make, both for deterministic and non-deterministic machines.
Journal ArticleDOI
State-deterministic $$5'\rightarrow 3'$$ Watson-Crick automata
TL;DR: A new class, the state-deterministic, is placed into the hierarchy based on the accepted language classes, that is in each configuration of a computation (if it is not finished yet) the next state is determined by the actual state of the configuration.
Journal ArticleDOI
On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers
Benedek Nagy,Zita Kovács +1 more
TL;DR: This work defines WK transducers such that, at each transition, exactly one input letter is being processed, and exactly one output letter is written on a normal output tape.
Journal ArticleDOI
$$5'\rightarrow 3'$$ 5 ′ → 3 ′ Watson–Crick automata languages-without sensing parameter
Benedek Nagy,Shaghayegh Parchami +1 more
TL;DR: In this paper, a new model is investigated, which works without the sensing parameter (it is done by an appropriate change of the concept of configuration) and the accepted language classes of the variants are also changed.
Journal ArticleDOI
Watson–Crick Jumping Finite Automata: Combination, Comparison and Closure
TL;DR: A restricted version of the Watson–Crick jumping finite automata model is introduced that is a combination of variants of the existing model, and the closure properties of such restricted automata are explored.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Book
Regulated rewriting in formal language theory
Jrgen Dassow,Gheorghe Paun +1 more
TL;DR: This book presents 25 different regulating mechanisms by definitions, examples and basic facts, especially concerning hierarchies, as well as selective substitution grammars as one common generalization.
Journal ArticleDOI
On Context-Free Languages
TL;DR: In this report, certain properties of context-free (CF or type 2) Grammars are investigated, like that of Chomsky, and it is shown that this type of grammar is essentially stronger than type 2 grammars and has the advantage over type 1 grammARS that the phrase structure of a grammatical sentence is unique, once the derivation is given.
Book
DNA Computing: New Computing Paradigms
TL;DR: This book starts with an introduction to DNA computing, exploring the power of complementarity, the basics of biochemistry, and language and computation theory, and brings the reader to the most advanced theories develop thus far in this emerging research area.
Book
Introduction to Formal Languages and Automata
TL;DR: This textbook is designed for an introductory course for computer science and computer engineering majors who have knowledge of some higher-level programming language, the fundamentals of formal languages, automata, computability, and related matters.