Affiliation:
1. ICTT and ISN Laboratory, Xidian University, Xi'an, P.R. China
Funder
Key Science and Technology Innovation Team of Shaanxi Provience
Major Program of the Ministry of Science and Technology of China with Grant
National Natural Science Foundation of China
Reference15 articles.
1. M. Michel. 1988. Complementation is more difficult with automata on infinite words. CNET (1988). M. Michel. 1988. Complementation is more difficult with automata on infinite words. CNET (1988).
2. N. Piterman. 2007. From nondeterministic Büchi and Streett automata to deterministic parity automata. Journal of Logical Methods in Computer Science 3 (2007). N. Piterman. 2007. From nondeterministic Büchi and Streett automata to deterministic parity automata. Journal of Logical Methods in Computer Science 3 (2007).
3. Propositional dynamic logic of looping and converse is elementarily decidable