|
Frank Morawietz and Tom Cornell"Approximating Principles and Parameters Grammars with MSO Tree Logics"Extended abstract, 4pp., DVI (28kb); Postscript (225kb)1-up; Postscript gzip-komprimiert (64kb) 1-up , 2-up. AbstractThe decidability proof for weak MSO logic on two successor functions (WS2S) involves the compilation of MSO formulas into tree automata. While it is not possible to get beyond context-freeness with WS2S, we show how to approximate P&P grammars by parameterizing the compilation process with a particular input. The embedding into a CLP scheme is proposed to overcome some of the inherent engineering problems.
Appears in the Proceedings of the LACL Conference '97, 1997 |
|
In case of problems or for comments, please contact: frank@sfs.uni-tuebingen.de Last updated: 13-Mar-2000 |