644 search results - page 64 / 129 » Precedence Automata and Languages |
138
click to vote
TCS
2008
15 years 4 months ago
2008
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
159
click to vote
RTA
2005
Springer
15 years 10 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
134
click to vote
ICALP
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
139
Voted
COORDINATION
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Recent approaches to component-based software engineering employ coordinating connectors to compose components into software systems. For maximum flexibility and reuse, s...
126
click to vote
LATA
2009
Springer
15 years 11 months ago
2009
Springer
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...