: Equational Specification of Partial Higher-Order Algebras.
Farid M. Ablyv
: The Complexity Properties of Probabilistic Automata with Isolated Cut Point.
: The Advantages of a New Approach to Defining the Communication Complexity for VLSI.
: Entropy of Contact Circuits and Lower Bounds on Their Complexity.
: Matrix Systems and Principal Cones of Algebraic Power Series.
: The Semantics and Proof Theory of Linear Logic.
: An Algebraic Structure for Derivations in Rewriting Systems.
: Notes on Congruence Relations and Factor Pumping Conditions for Rational Languages.