Decidability and Complexity of Finitely Closable Linear Equational Theories
نویسندگان
چکیده
We deene a subclass of the class of linear equational theories, called nitely closable linear theories. We consider uniication problems with no repeated variables. We show the decidability of this subclass, and give an algorithm in PSPACE. If all function symbols are monadic, then the running time is in NP, and quadratic for unitary monadic nitely closable linear theories.
منابع مشابه
Definability in the lattice of equational theories of semigroups
We study first-order definability in the lattice L of equational theories of semigroups. A large collection of individual theories and some interesting sets of theories are definable in L . As examples, if T is either the equational theory of a finite semigroup or a finitely axiomatizable locally finite theory, then the set {T, T } is definable, where T ∂ is the dual theory obtained by invertin...
متن کاملDeciding Knowledge in Security Protocols Under Equational Theories
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in terms of message deducibility and indistinguishability relations. In this paper we study the decidability of these two relations. The messages in question may employ functions (encryption, decryption, etc.) axiomatized...
متن کاملCombining Equational Tree Automata over AC and ACI Theories
In this paper, we study combining equational tree automata in two different senses: (1) whether decidability results about equational tree automata over disjoint theories E1 and E2 imply similar decidability results in the combined theory E1 ∪ E2; (2) checking emptiness of a language obtained from the Boolean combination of regular equational tree languages. We present a negative result for the...
متن کاملCombining Algorithms for Deciding Knowledge in Security Protocols
In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic functions (encryption, exclusive or, . . . ). The analysis of cryptographic protocols requires a precise understanding of the attacker knowledge. Two standard notions are usually used: deducibility and indistinguishability. Those no...
متن کاملThe Existence of Finitely Based Lower Covers for Finitely Based Equational Theories
By an equational theory we mean a set of equations from some fixed language which is closed with respect to logical consequences. We regard equations as universal sentences whose quantifierfree parts are equations between terms. In our notation, we suppress the universal quantifiers. Once a language has been fixed, the collection of all equational theories for that language is a lattice ordered...
متن کامل