This work deals with automata systems. We define parallel automata systems and parallel communicating automata systems communicating by transitions, whose components are finite state automata. We investigate their properties compared with grammar systems or grammars
A parallel communicating automata system consists of several automata working independently in paral...
Bus automata are defined as a class of uniform arrays of finite automata (“cells”) with modifiable c...
In this paper, we introduce a new kind of automata systems, called state-synchronized automata syste...
Abstract. A parallel communicating finite automata system is an accepting device based on the commun...
This bachelor thesis deals with automata systems, especially the ones, which are defined as state an...
This paper introduces and discusses automata systems as a new way for formal languages processing. I...
This work deals with Systems that combine automata and grammars. We investigate their properties com...
We survey various automata models of concurrent systems and their connection with monadic second-ord...
Abstract: We show how finite-state automata over finite and infinite words can capture key dynamical...
International audienceWe survey various automata models of concurrent systems and their connection w...
AbstractIn this tutorial paper, we consider various classes of automata generated by simple rewrite ...
The theory of automata and formal language was devised in the 1930s to provide models for and to rea...
These lecture notes report on the use of automata theory in the study of infinite transition systems...
This thesis defines and studies two new types of automata, cooperating distributed pushdown automata...
A parallel communicating automata system consists of several automata working independently in paral...
A parallel communicating automata system consists of several automata working independently in paral...
Bus automata are defined as a class of uniform arrays of finite automata (“cells”) with modifiable c...
In this paper, we introduce a new kind of automata systems, called state-synchronized automata syste...
Abstract. A parallel communicating finite automata system is an accepting device based on the commun...
This bachelor thesis deals with automata systems, especially the ones, which are defined as state an...
This paper introduces and discusses automata systems as a new way for formal languages processing. I...
This work deals with Systems that combine automata and grammars. We investigate their properties com...
We survey various automata models of concurrent systems and their connection with monadic second-ord...
Abstract: We show how finite-state automata over finite and infinite words can capture key dynamical...
International audienceWe survey various automata models of concurrent systems and their connection w...
AbstractIn this tutorial paper, we consider various classes of automata generated by simple rewrite ...
The theory of automata and formal language was devised in the 1930s to provide models for and to rea...
These lecture notes report on the use of automata theory in the study of infinite transition systems...
This thesis defines and studies two new types of automata, cooperating distributed pushdown automata...
A parallel communicating automata system consists of several automata working independently in paral...
A parallel communicating automata system consists of several automata working independently in paral...
Bus automata are defined as a class of uniform arrays of finite automata (“cells”) with modifiable c...
In this paper, we introduce a new kind of automata systems, called state-synchronized automata syste...