2465 search results - page 48 / 493 » Automata on Linear Orderings |
LATA
2009
Springer
14 years 2 months ago
2009
Springer
We show that fixed membership testing for many interesting subclasses of multi-pushdown machines is no harder than for pushdowns with single stack. The models we consider are MVPA...
LATA
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a...
FCT
2009
Springer
13 years 11 months ago
2009
Springer
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular -language parametrized by P. In this context, an -word, representing a play, h...
CSL
2010
Springer
13 years 9 months ago
2010
Springer
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...
ORDER
2007
13 years 7 months ago
2007
Abstract. We analyze results on well-partial-orderings from the viewpoint of computability theory, and we answer a question posed by Diana Schmidt. We obtain the following results....