Results 11 to 20 of about 34 (34)
Homomorphism Preserving Algebraic Specifications Require Hidden Sorts [PDF]
, 1993 Although every computable data type has an initial algebra specification with hidden functions, it may happen that some of the homomorphic images of the data type are not models of the specification.
J. Heering +3 more
core
On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers [PDF]
, 1999 This paper shows that the collection of identities in two variableswhich hold in the algebra N of the natural numbers with constantzero, and binary operations of sum and maximum does not have afinite equational axiomatization.
Ésik, Zoltán +2 more
core
, 1996 Salomaa ((1969) Theory of Automata, page 143) asked whether the equational theory of regular expressions over a singleton alphabet has a finite equational base. In this paper, we provide a negative answer to this long standing question.
Aceto, Luca +2 more
core
, 1996 Fokkink and Zantema ((1994) Computer Journal 37:259-267) have shown thatbisimulation equivalence has a finite equational axiomatization over the languageof Basic Process Algebra with the binary Kleene star operation (BPA*).
Aceto, Luca +2 more
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy
SIAM Journal on Computing, 2021Venkatesan Guruswami, Joshua Brakensiek
exaly
Detection of application layer DDoS attacks using big data technologies
Journal of Discrete Mathematical Sciences and Cryptography, 2020Sunita Singhal
exaly
Congruence Distributivity Implies Bounded Width
SIAM Journal on Computing, 2010Marcin Kozik, Libor Barto
exaly
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing, 2005Andrei Bulatov +2 more
exaly