426 search results - page 5 / 86 » Synchronization of Regular Automata |
STOC
2005
ACM
16 years 2 months ago
2005
ACM
LATA
2009
Springer
15 years 8 months ago
2009
Springer
120
click to vote
CSL
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
DLT
2006
15 years 3 months ago
2006
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...
84
Voted
FSTTCS
2008
Springer
15 years 2 months ago
2008
Springer
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...