On the complementation of asynchronous cellular Buchi automata

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.169, Iss.2, 1996-12, pp. : 123-145

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

Asynchronous cellular automata for pomsets

By Droste M. Gastin P. Kuske

Theoretical Computer Science, Vol. 247, Iss. 1, 2000-09 ,pp. : 1-38

Elsevier

Access to resources Recommend Favorite

Foreword: asynchronous cellular automata and applications

By Dennunzio Alberto Fatès Nazim Formenti Enrico

Natural Computing, Vol. 12, Iss. 4, 2013-12 ,pp. : 537-538

Springer Publishing Company

Access to resources Recommend Favorite

Unambiguous Buchi automata

By Carton O. Michel M.

Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. : 37-81

Elsevier

Access to resources Recommend Favorite

m-Asynchronous cellular automata: from fairness to quasi-fairness

By Dennunzio Alberto Formenti Enrico Manzoni Luca Mauri Giancarlo

Natural Computing, Vol. 12, Iss. 4, 2013-12 ,pp. : 561-572

Springer Publishing Company

Access to resources Recommend Favorite

Automata of asynchronous behaviors

By Brzozowski J.A. Negulescu R.

Theoretical Computer Science, Vol. 231, Iss. 1, 2000-01 ,pp. : 113-128

Elsevier

Access to resources Recommend Favorite