113 search results - page 15 / 23 » Height-Deterministic Pushdown Automata |
107
Voted
ENTCS
2006
15 years 1 months ago
2006
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
104
click to vote
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
In this paper, we focus on XML data integration by studying rewritings of XML target schemas in terms of source schemas. Rewriting is very important in data integration systems wh...
VMCAI
2010
Springer
15 years 11 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
104
click to vote
LATA
2010
Springer
15 years 8 months ago
2010
Springer
Operator precedence languages, designated as Floyd’s Languages (FL) to honor their inventor, are a classical deterministic context-free family. FLs are known to be a boolean fami...
101
click to vote
FOSSACS
2009
Springer
15 years 5 months ago
2009
Springer
We study generalized fixed-point equations over idempotent semirings and provide an efficient algorithm for the detection whether a sequence of Kleene's iterations stabilizes ...