Monodic tree Kleene algebra

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

Volumn 4136 LNCS, Issue , 2006, Pages 402-416

  Takai, Toshinori ^a   Furusawa, Hitoshi ^b  

^a NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

^b KAGOSHIMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; OPTIMIZATION; THEOREM PROVING; TREES (MATHEMATICS);

AXIOMATIZATION; DETERMINIZATION; KLEENE ALGEBRA; REGULAR TREE LANGUAGES;

MATRIX ALGEBRA;

EID: 33750052570     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11828563_27     Document Type: Conference Paper

References (10)

1. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata/ (1997)
2. Ésik, Z.: Axiomatizing the equational theory of regular tree languages (extended anstract). In Morvan, M., Meinel, C., Krob, D., eds.: STACS. Volume 1373 of Lecture Notes in Computer Science., Springer (1998) 455-465
3. Takai, T., Furusawa, H., Kahl, W.: Reasoning about term rewriting in Kleene categories with converse. In Düntsch, I., Winter, M., eds.: Proceedings of the 3rd Workshop on Applications of Kleene algebera. (2005) 259-266
4. Gécseg, F., Steinby, M.: Tree languages. In: Handbook of formal languages, 3: beyond words. Springer (1997) 1-68
5. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. In Kahn, G., ed.: Proceedings of the Sixth Annual IEEE Symp. on Logic in Computer Science, LICS 1991, IEEE Computer Society Press (1991) 214-225
6. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation 110(2) (1994) 366-390
7. Möller, B.: Lazy Kleene algebra. In Kozen, D., Shankland, C., eds.: MPC. Volume 3125 of Lecture Notes in Computer Science., Springer (2004) 252-273
8. McIver, A., Weber, T.: Towards automated proof support for probabilistic distributed systems. In Sutcliffe, G., Voronkov, A., eds.: LPAR. Volume 3835 of Lecture Notes in Computer Science., Springer (2005) 534-548
9. McIver, A., Cohen, E., Morgan, C.: Using probabilistic Kleene algebra for protocol verification. In: Relations and Kleene Algebra in Computer Science. Volume 4136 of Lecture Notes in Computer Science. (2006)
10. Möller, B., Struth, G.: Modal Kleene algebra and partial correctness. In Rattray, C., Maharaj, S., Shankland, C., eds.: AMAST. Volume 3116 of Lecture Notes in Computer Science., Springer (2004) 379-393