8 search results - page 2 / 2 » A Note on Two-pebble Automata Over Infinite Alphabets |
ICDT
2010
ACM
14 years 2 months ago
2010
ACM
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
DLT
2007
13 years 6 months ago
2007
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...