4 search results - page 1 / 1 » On the Complexity of Membership and Counting in Height-Deter... |
CSR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
MFCS
2007
Springer
13 years 10 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...
LATA
2009
Springer
13 years 11 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...
FCT
1991
Springer
13 years 8 months ago
1991
Springer
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...