One of the most important conditions for replication in early evolution is the de facto elimination of the conformational degrees of freedom of the replicators, the mechanisms of which remain unclear. In addition, realistic evolutionary timescales can be established based only on partially directed evolution, further complicating this issue. A division of the various evolutionary theories into ...

This paper is a survey on logical aspects of nite automata Central points are the connection between nite automata and monadic second order logic the Ehrenfeucht Fra ss e technique in the context of formal language theory nite automata on words and their determinization and a self contained proof of the Rabin Tree Theorem Sections and contain material presented in a lecture series to the Final ...

This paper is a self-contained introduction to the theory of nite-state automata on innnite words. The study of automata on innnite inputs was initiated by B uchi in order to settle certain decision problems arising in logic. Subsequently, there has been a lot of fundamental work in this area, resulting in a rich and elegant mathematical theory. In recent years, there has been renewed interest ...

In this paper, we study two important problems related to quasi-multiautomata: the complicated nature of verification GMAC condition for systems quasi-multiautomata, and fact that quasi-multiautomata has deviated from original automata as seen by theory formal languages. For former problem, include several new conditions simplify procedure. latter close gap presenting a construction which corre...

This paper is concerned with the universality problem for timed automata: given a timed automatonA, doesA accept all timed words? Alur and Dill have shown that the universality problem is undecidable if A has two clocks, but they left open the status of the problem when A has a single clock. In this paper we close this gap for timed automata over infinite words by showing that the one-clock uni...

Alur, R. and D.L. Dill, A theory of timed automata, Theoretical Computer Science 126 (1994) 183-235. We propose timed (j&e) automata to model the behavior of real-time systems over time. Our definition provides a simple, and yet powerful, way to annotate state-transition graphs with timing constraints using finitely many real-valued clocks. A timed automaton accepts timed words-infinite sequenc...