Program equivalence checking by two-tape automata

ISSN： 1060-0396

Source： Cybernetics and Systems Analysis, Vol.46, Iss.4, 2010-07, pp. : 554-562

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

DP lower bounds for equivalence-checking and model-checking of one-counter automata

By Jancar P. Kucera A. Moller F. Sawa Z.

Information and Computation, Vol. 188, Iss. 1, 2004-01 ,pp. : 1-19

Elsevier

Access to resources Recommend Favorite

Equivalence of deterministic pushdown automata revisited

By Meitus V.

Cybernetics and Systems Analysis, Vol. 43, Iss. 2, 2007-03 ,pp. : 179-191

Springer Publishing Company

Access to resources Recommend Favorite

Language recognition by two-way deterministic pushdown automata

By Lisovik L. Koval’ D.

Cybernetics and Systems Analysis, Vol. 40, Iss. 6, 2004-11 ,pp. : 939-942

Springer Publishing Company

Access to resources Recommend Favorite

SIMULTANEOUSLY ONE-TURN TWO-PUSHDOWN AUTOMATA

By MEDUNA A.

International Journal of Computer Mathematics, Vol. 80, Iss. 6, 2003-06 ,pp. : 679-687

Taylor & Francis Ltd

Access to resources Recommend Favorite

Star-triangle equivalence in two-dimensional soap froths

By Mancini M. Oguey C.

Philosophical Magazine Letters, Vol. 83, Iss. 10, 2003-10 ,pp. : 643-649

Taylor & Francis Ltd

Access to resources Recommend Favorite