495 search results - page 24 / 99 » Automata and differentiable words |
DLT
2008
14 years 11 months ago
2008
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...
88
Voted
TALG
2010
14 years 8 months ago
2010
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
CAV
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
CONCUR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
JUCS
2002
14 years 9 months ago
2002
: Over the last 30 years or so many results have appeared on the descriptional complexity of machines with limited resources. Since these results have appeared in a variety of diff...