6 search results - page 2 / 2 » Boundedness of Monadic Second-Order Formulae over Finite Wor... |
162
click to vote
MFCS
1998
Springer
15 years 10 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 ...