APAL
2005
13 years 4 months ago
2005
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
ENTCS
2010
13 years 4 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites-a property that eliminates spurious interprocedural...
MFCS
1998
Springer
13 years 8 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...