815 search results - page 143 / 163 » Algebraic Recognizability of Languages |
125
click to vote
MCMASTER
1993
15 years 3 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
117
click to vote
APLAS
2008
ACM
15 years 1 months ago
2008
ACM
ion of Clocks in Synchronous Data-flow Systems Albert Cohen1 , Louis Mandel2 , Florence Plateau2 , and Marc Pouzet23 1 INRIA Saclay - Ile-de-France, Orsay, France 2 LRI, Univ. Pari...
117
click to vote
CORR
2004
Springer
14 years 11 months ago
2004
Springer
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
125
click to vote
PEPM
2011
ACM
14 years 2 months ago
2011
ACM
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
CADE
2001
Springer
16 years 2 days ago
2001
Springer
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...