54 search results - page 4 / 11 » On Deciding Topological Classes of Deterministic Tree Langua... |
STOC
2002
ACM
14 years 7 months ago
2002
ACM
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant ? > 0 such that if there is some l...
CONCUR
2004
Springer
14 years 26 days ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on t...
JCSS
2007
13 years 7 months ago
2007
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...