644 search results - page 44 / 129 » Precedence Automata and Languages |
110
click to vote
ICALP
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
90
Voted
FSTTCS
2006
Springer
15 years 3 months ago
2006
Springer
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
82
Voted
ICALP
2000
Springer
15 years 3 months ago
2000
Springer
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
FUIN
2010
14 years 9 months ago
2010
It is shown that the emptiness problem for 2-PA languages is undecidable and that 2-PA are weaker than 3-PA.
172
click to vote
FOSSACS
2011
Springer
14 years 3 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...