Sciweavers

303 search results - page 4 / 61
» Automata on Gauss Words
Sort
View
DLT
2006
15 years 1 months ago
Synchronization of Pushdown Automata
Abstract. We introduce the synchronization of a pushdown automaton by a sequential transducer associating an integer to each input word. The visibly pushdown automata are the autom...
Didier Caucal
84
Voted
ENTCS
2006
96views more  ENTCS 2006»
15 years 11 days ago
Weighted Timed Automata: Model-Checking and Games
In this paper, we present weighted/priced timed automata, an extension of timed automaton with costs, and solve several interesting problems on that model. Key words: Weighted/pri...
Patricia Bouyer
JUCS
2002
91views more  JUCS 2002»
15 years 16 hour ago
On Quasi-Products of Tree Automata
Abstract: In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the inputs of the component tree automata are operational symbols in whic...
Ferenc Gécseg
ICALP
2010
Springer
15 years 5 months ago
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
Hugo Gimbert, Youssouf Oualhadj
90
Voted
AMW
2010
15 years 1 months ago
What You Must Remember When Processing Data Words
We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by deterministic finite-memory automata (DMA). As a byproduct of this characteriza...
Michael Benedikt, Clemens Ley, Gabriele Puppis