54 search results - page 8 / 11 » On Deciding Topological Classes of Deterministic Tree Langua... |
FCT
2005
Springer
14 years 1 months ago
2005
Springer
Leftist grammars can be characterized in terms of rules of the form a → ba and cd → d, without distinction between terminals and nonterminals. They were introduced by Motwani e...
ICALP
1999
Springer
13 years 11 months ago
1999
Springer
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simu...
FSTTCS
2004
Springer
14 years 26 days ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
CSL
2010
Springer
13 years 8 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...
LICS
1997
IEEE
13 years 11 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...