1728 search results - page 5 / 346 » The Size of Power Automata |
IPL
2008
13 years 7 months ago
2008
Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language re...
JAC
2008
13 years 8 months ago
2008
Abstract. We consider simulations of graph automata. We introduce two local transformations on the neighborhood: splitting and merging. We explain how to use such transformations, ...
NC
2010
13 years 5 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...
CONCUR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...