213 search results - page 6 / 43 » Relating Word and Tree Automata |
131
Voted
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
139
Voted
CSL
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
140
Voted
WIA
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
118
Voted
ICCS
2007
Springer
15 years 9 months ago
2007
Springer
Complex Automata were recently proposed as a paradigm to model multi-scale complex systems. The concept is formalized and the scale separation map is further investigated in relati...
132
Voted
DLT
2008
15 years 5 months ago
2008
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be...