Sciweavers

Share
4 search results - page 1 / 1
» lata 2016
Sort
View
LATA
2016
Springer
3 years 12 days ago
Normal Form on Linear Tree-to-Word Transducers
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...
Adrien Boiret
LATA
2016
Springer
3 years 12 days ago
Minimal Separating Sequences for All Pairs of States
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...
Rick Smetsers, Joshua Moerman, David N. Jansen
LATA
2016
Springer
3 years 12 days ago
On the Capacity of Capacitated Automata
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. ...
Orna Kupferman, Sarai Sheinvald
LATA
2016
Springer
3 years 12 days ago
A Logical Characterization for Dense-Time Visibly Pushdown Automata
Two of the most celebrated results that effectively exploit visual representation to give logical characterization and decidable modelchecking include visibly pushdown automata (V...
Devendra Bhave, Vrunda Dave, Shankara Narayanan Kr...
books