Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Handbook of formal languages, vol. 3
Automata based symbolic reasoning in hardware verification
Formal Methods in System Design
Descriptive Approach to Language - Theoretic Complexity
Descriptive Approach to Language - Theoretic Complexity
MOSEL: A FLexible Toolset for Monadic Second-Order Logic
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Mona: Monadic Second-Order Logic in Practice
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Feature Automata and Recognizable Sets of Feature Trees
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
LISA: A Specification Language Based on WS2S
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Representing constraints with automata
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
A domain-specific language for regular sets of strings and trees
DSL'97 Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997
Tree acceptors and some of their applications
Journal of Computer and System Sciences
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Minimalist tree languages are closed under intersection with recognizable tree languages
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Does o-substitution preserve recognizability?
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
| Hi-index | 0.01 |
In this paper we discuss possible applications of a system which uses automata-based theorem-proving techniques drawing on the decidability proof forweak monadic second-order (MSO) logic on trees to implement linguistic processing and theory verification. Despite a staggering complexcity bound, the success of and the continuing work on these techniques in computer science promises a usable tool to test formalizations of grammars. The advantages are readily apparent. The direct use of a succinct and flexible description language together with an environment to test the formaliz ations with the resulting finite, deterministic tree automata offers a way of combining the needs of both formalization and processing. The aim of this paper is threefold. Firstly we show how to use this technique for the verification of separate modules of a Principles-and-Parameters (P&P) grammar and secondly for the approximation of an entire P&P theory. And thirdly, we extend the language of the MSO tree logic to overcome remaining engineering problems.