Binding-blocking automata
01 Sep 2013-International Journal of Computer Mathematics (Taylor & Francis)-Vol. 90, Iss: 9, pp 1809-1831
TL;DR: This work defines normal-forms of binding-blocking automata for one of its variants and shows that the acceptance power of this variant of BBA is strictly less than that of multi-head finite automata.
Abstract: We propose an automaton model called as binding-blocking automaton BBA. It is a finite state automaton together with the ability to block some symbols and postpone them for reading by the head at a later time. The idea of blocking some symbols from being read by the head and unblocking when the system requires to read is motivated by peptide computing where some parts of peptide sequences are blocked by attaching an antibody with higher affinity and unblocked at a later point by the removal of the appropriate antibody. We study the variants of such systems, analyse the power of each variants and show various hierarchy results involving them. We also define normal-forms of binding-blocking automata for one of its variants and also show that the acceptance power of this variant of BBA is strictly less than that of multi-head finite automata.
Citations
More filters
01 Jan 2009
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.
Abstract: 5′ → 3′ WK-automata are Watson-Crick automata whose two heads start on opposite ends of the input word and always run in opposite directions. One full reading in both directions is called a run. We prove that the expressive power of these automata increases with every additional run that they can make, both for deterministic and non-deterministic machines. This defines two incomparable infinite hierarchies of language classes between the regular and the context-sensitive languages. These hierarchies are complemented with classes defined by several restricted variants of 5′ → 3′ WK-automata like stateless automata. Finally we show that several standard problems are undecidable for languages accepted by 5′ → 3′ WK-automata in only one run, for example the emptiness and the finiteness problems.
23 citations
Journal Article•
TL;DR: A survey on the various models of restarting automata and their properties is given, their relationships to the language classes of the Chomsky hierarchy are described, and some open problems are presented.
Abstract: The restarting automaton, introduced by Jancar et al in 1995, is motivated by the so-called 'analysis by reduction,' a technique from linguistics. By now there are many different models of restarting automata, and their investigation has proved very fruitful in that they offer an opportunity to study the influence of various kinds of resources on their expressive power. Here a survey on the various models and their properties is given, their relationships to the language classes of the Chomsky hierarchy are described, and some open problems are presented.
7 citations
27 Sep 2011
TL;DR: This paper studies some of the properties of binding-blocking automaton using a measure called blocking quotient and shows that any Binding-Blocking Automata can accept only languages where the length grows in a linear fashion.
Abstract: Binding-Blocking Automata is an automaton model that is inspired by peptide computing. This is a finite state automaton together with the facility to postpone the reading of some symbols to a later part of time by blocking of symbols. In this paper, we study some of the properties of binding-blocking automaton using a measure called blocking quotient and show that any Binding-Blocking Automata can accept only languages where the length grows in a linear fashion. This is the first attempt to study the properties of binding-blocking automata and we feel that this will lead us to investigate further into the properties of this automaton model.
1 citations
References
More filters
Book•
01 Jan 1989
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.
Abstract: It is well-known that context-free grammars cannot cover all aspects of natural languages, progamming languages and other related fields. Therefore a lot of mechanisms have been introduced which control the application of context-free rules. This book presents 25 different regulating mechanisms by definitions, examples and basic facts, especially concerning hierarchies. Matrix, programmed, and random context grammars as typical representants are studied in more detail. Besides their algebraic and decidability properties a comparison is made with respect to syntactic complexity measures and pure versions. Further topics are combinations of some control mechanisms, regulated L systems, automata characterizations, Szilard languages, and grammar forms of regulated grammars as well as selective substitution grammars as one common generalization.
847 citations
TL;DR: There are languages which can be recognized by a deterministic (k + 1)-headed oneway finite automaton but which cannot be recognizing by a k-headed one-way (deterministic or non-Deterministic) finite Automaton.
Abstract: : There are languages which can be recognized by a deterministic (k+1)-headed one-way finite automaton but which cannot be recognized by a k-headed one-way (deterministic or non-deterministic) finite automaton. Furthermore, there is a language accepted by a k-headed nondeterministic finite automaton which is accepted by no k-headed deterministic finite automaton. (Author)
128 citations
"Binding-blocking automata" refers background in this paper
...One-way multi-head finite automata have been studied in several places in the literature [7,14,17, 25,26]....
[...]
TL;DR: It is shown that deterministic two-way finite automata with n+2 heads are strictly more powerful than deterministicTwo- way finite automATA with n heads for each positive integer n.
100 citations
"Binding-blocking automata" refers methods in this paper
...Two-way multi-head automata [13,19] have also been studied but here we use only oneway multi-head finite automata....
[...]
TL;DR: The classes of languages over a one-letter alphabet acceptable by deterministic {respectively nondeterministic} two-way k-headfinite automata are dénoteed and Hierarchy results are proved.
Abstract: — Let H (k) and NH (k) dénote the classes of languages over a one-letter alphabet acceptable by deterministic {respectively nondeterministic) two-way k-headfinite automata. It will be shown that H (k) i H (/c+ 1) and NH (k) J NH (fc+1) holdsfor allk^l. Hierarchy results are also provedfor the classes oflanguages over a one-letter alphabet defined by k-counter automata with linear bounded counters and by k-register machines with linear bounded registers, respectively. Résumé. — On désigne par H (k) et NH {k) les familles des langages sur un alphabet à une seule lettre qui sont reconnaissables par des automates finis bilatères à k têtes déterministes (resp. non déterministes). On montre que H (k) J H {k + 1) et que NH (k) J NH (k + 1) pour tout k ^ 1. On donne également une hiérarchie dans les familles de langages définis par des automates à k-c ompteurs linéairement bornés et par des machines à k-registres linéairement bornés respectivement.
93 citations
"Binding-blocking automata" refers methods in this paper
...Two-way multi-head automata [13,19] have also been studied but here we use only oneway multi-head finite automata....
[...]
TL;DR: It is shown that for any recursively enumerable language, a Pautomaton and a certain type of projection can be constructed such that the given language is obtained as the image of the set of accepted input multiset sequences of the PAutomaton.
Abstract: In this paper we introduce the notion of a Pautomaton with one-way communication, a concept related both to Psystems and the traditional concept of automata. A Pautomaton with one-way communication is a purely communicating accepting P system. The result of the computation in these systems is the set of multiset sequences consumed by the skin membrane, supposing that the Pautomaton started functioning in an initial state and entered a so-called final state. As a result, we show that for any recursively enumerable language, a Pautomaton and a certain type of projection can be constructed such that the given language is obtained as the image of the set of accepted input multiset sequences of the Pautomaton.
87 citations
"Binding-blocking automata" refers methods in this paper
...Few bio-inspired automaton models such as Watson–Crick automata and P-automata have already been proposed and studied in the literature....
[...]
...Watson–Crick automata [11,24] is an automaton model inspired by DNA computing and P-automata [8] is an automaton model motivated by P-systems/membrane computing....
[...]