On the Complexity of Reasoning in Kleene Algebra-Reference-Cited by-同舟云学术

On the Complexity of Reasoning in Kleene Algebra

Published:2002-12 Issue:2 Volume:179 Page:152-162
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Kozen Dexter

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference34 articles.

1. The Design and Analysis of Computer Algorithms;Aho,1975

2. On the algebra of regular expressions;Anderaa,1965

3. Archangelsky, K. V. 1992, A new finite complete solvable quasiequational calculus for algebra of regular languages, manuscript, Kiev State University.

4. Closure Algorithms and the Star-Height Problem of Regular Languages;Backhouse,1975

5. Berstel, J. 1979, Transductions and Context-free Languages, Teubner, Stuttgart.

Cited by 36 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Tools for Completeness of Kleene Algebra with Hypotheses;Logical Methods in Computer Science;2024-05-16

2. Implicational Kleene algebra with domain and the substructural logic of partial correctness;Mathematical Structures in Computer Science;2024-03-04

3. Algorithmic complexity for theories of commutative Kleene algebras;Izvestiya: Mathematics;2024

4. Алгоритмическая сложность теорий коммутативных алгебр Клини;Известия Российской академии наук. Серия математическая;2024

5. Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26