Complete systems of \(\mathcal B\)-rational identities

From MaRDI portal
Publication:1177930


DOI10.1016/0304-3975(91)90395-IzbMath0737.68053MaRDI QIDQ1177930

Daniel Krob

Publication date: 26 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)


68Q45: Formal languages and automata


Related Items

Une condition impliquant toutes les identités rationnelles, There is no complete axiom system for shuffle expressions, A Fully Equational Proof of Parikh's Theorem, THE POWER OF THE GROUP-IDENTITIES FOR ITERATION, A Finite Axiomatization of Nondeterministic Regular Expressions, Rewriting extended regular expressions, Equational properties of Kleene algebras of relations with conversion, Axiomatizing the identities of binoid languages, A note on an expressiveness hierarchy for multi-exit iteration, Equational properties of iteration in algebraically complete categories, Models of a \(K\)-rational identity system, On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based, Group axioms for iteration, A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring, On dynamic algebras, Notes on equational theories of relations, An equational axiomatization for multi-exit iteration, Nonaxiomatisability of equivalences over finite state processes, The equational logic of fixed points, Completeness of Park induction, The multiplicative fragment of the Yanov equational theory, On the equational definition of the least prefixed point., Algebraically complete semirings and Greibach normal form, Automata, Boolean matrices, and ultimate periodicity., On equations for union-free regular languages, Equational theories of tropical semirings, Inductive \(^{*}\)-semirings, On the Burnside problem for semigroups of matrices in the \((\max,+)\) algebra, Models of nondeterministic regular expressions, The variety of Kleene algebras with conversion is not finitely based, Axiomatizing rational power series over natural numbers, On the complexity of reasoning in Kleene algebra, Iteration Semirings



Cites Work