478 search results - page 13 / 96 » Monads of Regular Theories |
85
Voted
JAPLL
2006
15 years 11 days ago
2006
In this paper we study the definability and decidability of binary predicates for time granularity in monadic languages interpreted over finitely and infinitely layered structures...
143
click to vote
AOSD
2012
ACM
13 years 8 months ago
2012
ACM
Aspect-Oriented Programming (AOP) started fifteen years ago with the remark that modularization of so-called crosscutting functionalities is a fundamental problem for the enginee...
98
Voted
ITA
2008
15 years 12 days ago
2008
We prove that there exists a structure M whose monadic second order theory is decidable, and such that the elementary theory of every expansion of M by a constant is undecidable. 1...
117
Voted
PODS
2008
ACM
16 years 16 days ago
2008
ACM
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the...
107
Voted
GG
2004
Springer
15 years 5 months ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...