Alternating weighted automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5699 LNCS, Issue , 2009, Pages 3-13

  Chatterjee, Krishnendu ^a   Doyen, Laurent ^b   Henzinger, Thomas A ^c  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL DECISION PROBLEMS; CLOSURE PROPERTY; DECISION PROBLEMS; EXPRESSIVE POWER; INFINITE WORD; MAXIMAL VALUES; NATURAL FUNCTIONS; NON-DETERMINISM; REAL NUMBER; TRANSITION WEIGHT; WEIGHTED AUTOMATA;

COMPUTABILITY AND DECIDABILITY; DECISION THEORY; EQUIVALENCE CLASSES; LINGUISTICS; NUMBER THEORY; QUERY LANGUAGES; ROBOTS; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 70349848212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03409-1_2     Document Type: Conference Paper

References (14)

1. Andersson, D.: An improved algorithm for discounted payoff games. In: ESSLLI Student Session, pp. 91-98 (2006)
2. Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation. Journal of the ACM 28(1), 114-133 (1981)
3. Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 385-400. Springer, Heidelberg (2008)
4. Chatterjee, K., Doyen, L., Henzinger, T.A.: Expressiveness and closure properties for quantitative languages. In: Proc. of LICS: Logic in Computer Science. IEEE Comp. Soc. Press, Los Alamitos (2009)
5. Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. International Journal of Game Theory 8, 109-113 (1979)
6. Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Heidelberg (1997)
7. Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)
8. Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Mathematics 23(3), 309-311 (1978)
9. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. Monographs in Theoretical Computer Science. An EATCS Series, vol. 5. Springer, Heidelberg (1986)
10. Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. ACM Trans. Comput. Log. 2(3), 408-429 (2001)
11. Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: Proc. of FOCS: Foundations of Computer Science, pp. 125-129. IEEE, Los Alamitos (1972)
12. Schützenberger, M.P.: On the definition of a family of automata. Information and control 4, 245-270 (1961)
13. Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science 49, 217-237 (1987)
14. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. of LICS: Logic in Computer Science, pp. 332-344. IEEE, Los Alamitos (1986)