171 search results - page 12 / 35 » On the Power of Tree-Walking Automata |
151
click to vote
CONCUR
2010
Springer
15 years 7 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...
145
click to vote
ICECCS
2005
IEEE
15 years 11 months ago
2005
IEEE
When designing a complex system, Object-Z is a powerful logic-based language for modeling the system state aspects, and Timed Automata is an excellent graph-based notation for cap...
166
Voted
FSMNLP
2008
Springer
15 years 7 months ago
2008
Springer
Weighted finite-state transducers have been used successfully in a variety of natural language processing applications, including speech recognition, speech synthesis, and machine ...
155
click to vote
TCS
2002
15 years 5 months ago
2002
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...
155
click to vote
CONCUR
2009
Springer
16 years 17 days ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...