LATA
2016
Springer
8 years 8 months ago
2016
Springer
Abstract. We study a subclass of tree-to-word transducers: linear treeto-word transducers, that cannot use several copies of the input. We aim to study the equivalence problem on t...
LATA
2016
Springer
8 years 8 months ago
2016
Springer
Abstract. Finding minimal separating sequences for all pairs of inequivalent states in a finite state machine is a classic problem in automata theory. Sets of minimal separating s...
LATA
2016
Springer
8 years 8 months ago
2016
Springer
Two of the most celebrated results that effectively exploit visual representation to give logical characterization and decidable modelchecking include visibly pushdown automata (V...
LATA
2016
Springer
8 years 8 months ago
2016
Springer
Capacitated automata (CAs) have been recently introduced in [8] as a variant of finite-state automata in which each transition is associated with a (possibly infinite) capacity. ...