Author： Holzer M. McKenzie P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.299, Iss.1, 2003-04, pp. : 307-326
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Checking Finite Traces using Alternating Automata
Electronic Notes in Theoretical Computer Science, Vol. 55, Iss. 2, 2004-01 ,pp. :
Access to resources
Recommend
The finite graph problem for two-way alternating automata
By Bojanczyk M.
Theoretical Computer Science, Vol. 298, Iss. 3, 2003-04 ,pp. :
Alternation for sublogarithmic space-bounded alternating pushdown automata
By Xu J. Yoshinaga T. Inoue K. Wang Y. Ito A.
Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. :
Efficient implementation of regular languages using reversed alternating finite automata
By Salomaa K. Wu X. Yu S.
Theoretical Computer Science, Vol. 231, Iss. 1, 2000-01 ,pp. :
Decision procedures for inductive Boolean functions based on alternating automata
By Ayari A. Basin D. Klaedtke F.
Theoretical Computer Science, Vol. 300, Iss. 1, 2003-05 ,pp. :