Properties of Binding-Blocking Automata: A Study

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.