The multiplicative fragment of the Yanov equational theory

Authors:
Igor Dolinka
Affiliations:
Department of Mathematics and Informatics, University of Novi Sad, Trg Dositeja Obradovic´a 4, 21000 Novi Sad, Serbia, Yugoslavia
Venue:
Theoretical Computer Science
Year:
2003

Citing 6
Cited 0

Complete systems of B -rational identities

Theoretical Computer Science
Iteration theories: the equational logic of iterative processes

Iteration theories: the equational logic of iterative processes
A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
The equational logic of fixed points

Theoretical Computer Science
On equations for union-free regular languages

Information and Computation
Theory of Automata

Theory of Automata

Quantified Score

Hi-index	5.23

Visualization

Abstract

We give a finite equational axiomatization for +-free identities of (regular) languages which contain the empty word. The axioms for the whole equational theory of such languages were given by Yanov.