495 search results - page 19 / 99 » Automata and differentiable words |
ICDAR
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper a handwritten recognition algorithm based on structural characteristics, histograms and profiles, is presented. The well-known horizontal and vertical histograms are...
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
WIA
2007
Springer
14 years 1 months ago
2007
Springer
We introduce a weighted logic with discounting and we establish B¨uchi’s and Elgot’s theorem for weighted automata over finite words and arbitrary commutative semirings. The...
IPL
2006
13 years 7 months ago
2006
In this paper, we strengthen two recent undecidability results of [9,10] about weighted timed automata, an extension of timed automata with cost variables. More precisely, we prop...
TCS
2008
13 years 7 months ago
2008
Eilenberg's variety theorem gives a bijective correspondence between varieties of languages and varieties of finite monoids. The second author gave a similar relation between...