We overview a series of our research on implementing finite automata in vitro and in vivo in the framework of DNA-based computing [2, 3]. First, we employ the lengthencoding technique proposed and presented in [5, 4] to implement finite automata in test tube. In the length-encoding method, the states and state transition functions of a target finite automaton are effectively encoded into DNA se...

This paper summarizes the fundamental expressiveness, closure, and decidability properties of various finite-state automata classes with multiple input tapes. It also includes an original algorithm for the intersection of one-way nondeterministic finite-state automata.

Timed systems, such as timed automata, are usually analyzed using their operational semantics on timed words. The classical region abstraction for timed automata reduces them to (untimed) finite state automata with the same time-abstract properties, such as state reachability. We propose a new technique to analyze such timed systems using finite tree automata instead of finite word automata. Th...

MOTIVATION Traditionally, distributed systems and protocols are described with finite state automata (finite state machines). As result of that, many tools based on finite state automata have been developed and used. Such an example is business state machines used in IBM WebSphere Integration Developer [1]. Later on, other more powerful mathematical tools for specification and analyses of distr...

We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regular expressions from finitestate automata, the resulting regular expressions are often very long and complicated. We examine the minimization of finite-state automata to obtain shorter expressions first. Then, we introd...

There exist an computational gap between the models that allowed to use quantum effects and that are not using quantum effects. Quantum Finite Automata (QFA), Quantum Pushdown Automata (QPDA), Quantum branching are several computational models. Some computational models are more powerful than classical counterparts and some are not. In this survey work, we have drawn a comparison among 1-way QF...