A modal perspective on the computational complexity of attribute value grammar
- 1 January 1993
- journal article
- research article
- Published by Springer Nature in Journal of Logic, Language and Information
- Vol. 2 (2) , 129-169
- https://doi.org/10.1007/bf01050635
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- The Logic of Typed Feature StructuresPublished by Cambridge University Press (CUP) ,1992
- Using the Universal Modality: Gains and QuestionsJournal of Logic and Computation, 1992
- Subsumption computed algebraicallyComputers & Mathematics with Applications, 1992
- Varieties of complex algebrasAnnals of Pure and Applied Logic, 1989
- Determinism and looping in combinatory PDLTheoretical Computer Science, 1988
- Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairnessJournal of the ACM, 1986
- A logical semantics for feature structuresPublished by Association for Computational Linguistics (ACL) ,1986
- Recurring dominoes: Making the highly undecidable highly understandable (preliminary report)Published by Springer Nature ,1983
- Deterministic propositional dynamic logic: Finite models, complexity, and completenessJournal of Computer and System Sciences, 1982
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979