3229 search results - page 7 / 646 » The Theory of Timed Automata |
CORR
2000
Springer
13 years 8 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
SIGMOD
2002
ACM
14 years 8 months ago
2002
ACM
LATA
2009
Springer
14 years 3 months ago
2009
Springer
LATA
2010
Springer
14 years 1 months ago
2010
Springer
CSL
2001
Springer
14 years 1 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...