Analyzing Automata with Presburger Arithmetic and Uninterpreted Function Symbols

By Rusu V.   Zinovieva E.  

Electronic Notes in Theoretical Computer Science, Vol. 50, Iss. 4, 2004-01 ,pp. : 1-15

Elsevier

Access to resources Recommend Favorite

The definable criterion for definability in Presburger arithmetic and its applications

By Muchnik A.A.  

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 1433-1444

Elsevier

Access to resources Recommend Favorite

EXORcist Boolean algebra and interactions between binary strings

By Musès C  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 24, Iss. 4, 1995-04 ,pp. : 33-43

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Boolean Algebra from the Lattice Point of View

By Lee Edward T  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 23, Iss. 3, 1994-03 ,pp. : 59-64

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

To the problem of expressibility in the algebra of partial Boolean functions

By Tarasov V.  

Problems of Information Transmission, Vol. 41, Iss. 1, 2005-01 ,pp. : 59-64

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite