171 search results - page 8 / 35 » On the Power of Tree-Walking Automata |
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in th...
IPL
2008
13 years 9 months ago
2008
: We investigate weighted automata with discounting and their behaviours over semirings and finitely generated graded monoids. We characterize the discounted behaviours of weighted...
MFCS
2001
Springer
14 years 2 months ago
2001
Springer
We describe a class of simple transitive semiautomata that exhibit full exponential blow-up during deterministic simulation. For arbitrary semiautomata we show that it is PSPACE-c...
ITNG
2007
IEEE
14 years 4 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
CONCUR
2009
Springer
14 years 4 months ago
2009
Springer