Sur les transductions reconnaissables
Sur quelques classes d’applications de dans les ensembles finis
Sur une classe de transformations d'arbres
Synchronized EOL forms under uniform interpretation
Syntactic complexity of regulated rewriting
Syntactic congruences and syntactic algebras
Syntactical definitions of program and flow diagram
Syntéza a minimalizace regulárních lineárních generátorů
Synthesis of non-initial automata
Systems of parallel communicating restarting automata
Several types of systems of parallel communicating restarting automata are introduced and studied. The main result shows that, for all types of restarting automata X, centralized systems of restarting automata of type X have the same computational power as non-centralized systems of restarting automata of the same type and the same number of components. This result is proved by a direct simulation. In addition, it is shown that for one-way restarting automata without auxiliary symbols, systems of...
Systolic tree acceptors