Equational axioms for regular sets-Reference-Cited by-同舟云学术

Equational axioms for regular sets

Published:1993-03 Issue:1 Volume:3 Page:1-24
ISSN:0960-1295
Container-title:Mathematical Structures in Computer Science
language:en
Short-container-title:Math. Struct. Comp. Sci.

Author:

Bloom S. L.,Ésik Z.

Abstract

We show that, aside from the semiring equations, three equations and two equation schemes characterize the semiring of regular sets with the Kleene star operation.

Publisher

Cambridge University Press (CUP)

Subject

Computer Science Applications,Mathematics (miscellaneous)

Reference20 articles.

1. Bloom S. L. and Ésik Z. (to appear c) Iteration algebras. International Journal of Foundations of Computer Science.

2. Implicational axioms for the algebra of regular languages (in Russian);Gorshkov;Doklady Akad. Nauk, Ukrainian SSR,1987

3. Automata-Theoretic Aspects of Formal Power Series

4. The Kleene theorem in countably complete semirings;Hebish;Bayreuther Mathematische Schriften,1990

5. Bloom S. L. , Ésik Z. and Taubner D. (to appear) Iteration theories of Synchronization trees. Information and Computation.

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

1. A Finite Axiomatisation of Finite-State Automata Using String Diagrams;Logical Methods in Computer Science;2023-02-15

2. A String Diagrammatic Axiomatisation of Finite-State Automata;Lecture Notes in Computer Science;2021

3. A Quest for Kleene Algebra in 2 Dimensions;Relational and Algebraic Methods in Computer Science;2015

4. On the Fine-Structure of Regular Algebra;Journal of Automated Reasoning;2014-12-03

5. A Connection Between Concurrency and Language Theory;Electronic Notes in Theoretical Computer Science;2013-11