11 search results - page 2 / 3 » Synchronizing Automata over Nested Words |
JUCS
2002
13 years 4 months ago
2002
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
NC
2010
13 years 2 months ago
2010
Abstract. Inspired by P systems initiated by Gheorghe P˜aun, we study a computation model over a multiset of communicating objects. The objects in our model are instances of fini...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
A cellular automaton (CA) is a parallel synchronous computing model, which consists in a juxtaposition of finite automata (cells) whose state evolves according to that of their ne...
CSL
2009
Springer
13 years 11 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...