127 search results - page 11 / 26 » Algebraic Characterization of Logically Defined Tree Languag... |
87
Voted
DIAGRAMS
2006
Springer
15 years 3 months ago
2006
Springer
The intuitive properties of configurations of planar non-overlapping closed curves (boundaries) are presented as a pure boundary mathematics. The mathematics, which is not incorpor...
110
click to vote
JAPLL
2006
14 years 11 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
103
Voted
CADE
2005
Springer
15 years 12 months ago
2005
Springer
We prove that, if the initial knowledge of the intruder is given by a deterministic bottom-up tree automaton, then the insecurity problem for cryptographic protocols with atomic ke...
111
click to vote
CADE
2004
Springer
15 years 12 months ago
2004
Springer
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
105
click to vote
TCS
2002
14 years 11 months ago
2002
This paper discusses a mathematical concept of language that models both artificial and natural languages and thus provides a framework for a unified language processing methodolo...