46 search results - page 6 / 10 » Strategical languages of infinite words |
COLING
1996
13 years 9 months ago
1996
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
IPL
2008
13 years 7 months ago
2008
This paper studies the equational theory of prebisimilarity, a bisimulation-based preorder introduced by Hennessy and Milner in the early 1980s, over basic CCS with the divergent ...
ECCC
2000
13 years 7 months ago
2000
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
FOIS
2006
13 years 9 months ago
2006
Natural languages are easy to learn by infants, they can express any thought that any adult might ever conceive, and they accommodate the limitations of human breathing rates and s...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...