Foundations of logic programming
Foundations of logic programming
Quasi-varieties in abstract algebraic institutions
Journal of Computer and System Sciences
Specifications in an arbitrary institution
Information and Computation - Semantics of Data Types
Models and equality for logical programming
II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
A logical theory of concurrent objects and its realization in the Maude language
Research directions in concurrent object-oriented programming
Logical support for modularisation
Papers presented at the second annual Workshop on Logical environments
Institutions for logic programming
Theoretical Computer Science - Special issue: algebraic development techniques
Computing in Systems Described by Equations
Computing in Systems Described by Equations
Logical foundations of cafeOBJ
Theoretical Computer Science - Rewriting logic and its applications
CASL: the common algebraic specification language
Theoretical Computer Science
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Institution-independent ultraproducts
Fundamenta Informaticae
Category-based constraint logic
Mathematical Structures in Computer Science
Service Specification and Matchmaking Using Description Logic
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Interpolation for predefined types
Mathematical Structures in Computer Science
| Hi-index | 0.89 |
SLP-compressed words are words given by simple deterministic grammars called "straight-line programs". We prove that the problem of deciding whether an SLP-compressed word is recognized by an FSA is complete for polynomial-time.