Weighted logics for nested words and algebraic formal power series

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

Volumn 5126 LNCS, Issue PART 2, 2008, Pages 221-232

  Mathissen, Christian ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BOOLEAN ALGEBRA; LINGUISTICS; MATRIX ALGEBRA; TRANSLATION (LANGUAGES);

FORMAL POWER SERIES; RECURSIVE PROGRAMS; SEMI-RING; SERIES-PARALLEL; WEIGHTED LOGICS;

CONTEXT FREE LANGUAGES;

EID: 49049101114     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70583-3_19     Document Type: Conference Paper

References (19)

1. Alur, R., Kumar, V., Madhusudan, P., Viswanathan, M.: Congruences for visibly pushdown languages. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1102-1114. Springer, Heidelberg (2005)
2. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proc. of the 36th STOC, Chicago, pp. 202-211. ACM, New York (2004)
3. Alur, R., Madhusudan, P.: Adding nesting structure to words. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 1-13. Springer, Heidelberg (2006)
4. Arenas, M., Barceló, P., Libkin, L.: Regular languages of nested words: Fixed points, automata, and synchronization. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 888-900. Springer, Heidelberg (2007)
5. Chomsky, N., Schützenberger, M.P.: The algebraic theory of context-free languages. In: Computer Programming and Formal Systems, pp. 118-161. North-Holland, Amsterdam (1963)
6. Courcelle, B.: Monadic second-order definable graph transductions: a survey. Theoretical Computer Science 126, 53-75 (1994)
7. Droste, M., Gastin, P.: Weighted automata and weighted logics. Theoretical Computer Science 380, 69-86 (2007)
8. Droste, M., Gastin, P.: Weighted automata and weighted logics. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, ch.5. Springer, Heidelberg (to appear, 2008)
9. Droste, M., Rahonis, G.: Weighted automata and weighted logics on infinite words. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 49-58. Springer, Heidelberg (2006)
10. Droste, M., Vogler, H.: Weighted tree automata and weighted logics. Theoretical Computer Science 366, 228-247 (2006)
11. Ésik, Z., Németh, Z.L.: Higher dimensional automata. Journal of Automata, Languages and Combinatorics 9(1), 3-29 (2004)
12. Hashiguchi, K., Ichihara, S., Jimbo, S.: Formal languages over free binoids. Journal of Automata, Languages and Combinatorics 5(3), 219-234 (2000)
13. Kuich, W.: Word, Language, Grammar. In: Handbook of Formal Languages, ch.9. Semirings and formal power series, vol. 1, pp. 609-677. Springer, Heidelberg (1997)
14. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. Springer, Heidelberg (1986)
15. Lautemann, C., Schwentick, T., Thérien, D.: Logics for context-free languages. In: CSL 1994. LNCS, vol. 933, pp. 205-216. Springer, Heidelberg (1994)
16. Mathissen, C.: Definable transductions and weighted logics for texts. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 324-336. Springer, Heidelberg (2007)
17. Mäurer, I.: Weighted picture automata and weighted logics. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 313-324. Springer, Heidelberg (2006)
18. Meinecke, I.: Weighted logics for traces. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 235-246. Springer, Heidelberg (2006)
19. Schwarz, S.: Łukasiewicz logics and weighted logics over MV-semirings. Journal of Automata, Languages and Combinatorics 12(4), 485-499 (2007)