Equational axioms for regular sets
- 4 March 1993
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 3 (1) , 1-24
- https://doi.org/10.1017/s0960129500000104
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.Keywords
This publication has 10 references indexed in Scilit:
- On induction vs. *-continuityPublished by Springer Nature ,2005
- Program correctness and matricial iteration theoriesPublished by Springer Nature ,1992
- Floyd-Hoare logic in iteration theoriesJournal of the ACM, 1991
- Equational logic of circular data type specificationTheoretical Computer Science, 1989
- Varieties of Iteration TheoriesSIAM Journal on Computing, 1988
- Axiomatizing schemes and their behaviorsJournal of Computer and System Sciences, 1985
- An axiomatization of regular forests in the language of algebraic theories with iterationLecture Notes in Computer Science, 1981
- Automata-Theoretic Aspects of Formal Power SeriesPublished by Springer Nature ,1978
- Two Complete Axiom Systems for the Algebra of Regular EventsJournal of the ACM, 1966
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIESProceedings of the National Academy of Sciences, 1963