Weak alternating automata are not that weak

DOI10.1145/377978.377993zbMath1171.68551MaRDI QIDQ3549125

Moshe Y. Vardi, Orna Kupferman

Publication date: 21 December 2008

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.216.961

Mathematics Subject Classification ID

68Q45: Formal languages and automata

03B70: Logic in computer science

03D05: Automata and formal grammars in connection with logical questions

68Q60: Specification and verification (program logics, model checking, etc.)

Related Items

From bidirectionality to alternation., From complementation to certification