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

From MaRDI portal
Revision as of 23:46, 29 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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)






Related Items (70)

Equational theories of tropical semiringsA Finite Axiomatisation of Finite-State Automata Using String DiagramsTHE POWER OF THE GROUP-IDENTITIES FOR ITERATIONSome quasi-varieties of iteration theoriesInductive \(^{*}\)-semiringsOn syntactic nuclei of rational languagesA complete system of identities for one-letter rational expressions with multiplicities in the tropical semiringOn dynamic algebras*-Continuous Kleene $$\omega $$-AlgebrasNotes on equational theories of relationsNonfinite axiomatizability of the equational theory of shuffleUnnamed ItemAxiomatizing the equational theory of regular tree languagesLeft-Handed CompletenessOn Completeness of Omega-Regular AlgebrasConway's work on iterationAxiomatizing rational power series over natural numbersInductive semimodules and the vector modules over them.Rational and Recognisable Power SeriesAn equational axiomatization for multi-exit iterationOn the Burnside problem for semigroups of matrices in the \((\max,+)\) algebraAxiomatizing the identities of binoid languagesNonaxiomatisability of equivalences over finite state processesEquational properties of iteration in algebraically complete categoriesFree inductive \(K\)-semialgebrasEquational Properties of Fixed Point Operations in Cartesian Categories: An OverviewSolving polynomial fixed point equationsThe equational logic of fixed pointsCompleteness of Park inductionCyclic hypersequent system for transitive closure logicThe multiplicative fragment of the Yanov equational theoryFree iterative and iteration \(K\)-semialgebrasOn the equational definition of the least prefixed point.Unnamed ItemOn tools for completeness of Kleene algebra with hypothesesCompleteness for flat modal fixpoint logicsThe convergent behavior for parametric generalized vector equilibrium problemsEquational properties of fixed-point operations in cartesian categories: An overviewIteration SemiringsModels of nondeterministic regular expressionsUne condition impliquant toutes les identités rationnellesA string diagrammatic axiomatisation of finite-state automataThe variety of Kleene algebras with conversion is not finitely basedCompleteness for Identity-free Kleene LatticesRewriting extended regular expressionsEquational properties of Kleene algebras of relations with conversionModels of a \(K\)-rational identity systemUnnamed ItemAlgebraically complete semirings and Greibach normal formA Finite Axiomatization of Nondeterministic Regular ExpressionsOn the complexity of reasoning in Kleene algebraLeft-handed completenessCompleteness theorems for Kleene algebra with tests and topA note on an expressiveness hierarchy for multi-exit iterationThere is no complete axiom system for shuffle expressionsOn tools for completeness of Kleene algebra with hypothesesOn a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely basedPartial Conway and Iteration Semiring-Semimodule PairsGroup axioms for iterationAutomata and rational expressionsEquational theories for automataUnique, guarded fixed points in an additive settingDiscrete-Event Systems in a Dioid Framework: Control TheoryAutomata, Boolean matrices, and ultimate periodicity.On equations for union-free regular languagesCyclic proofs, hypersequents, and transitive closure logicCompleteness results for omega-regular algebrasOn the fine-structure of regular algebraConway and iteration hemirings Part 1A Fully Equational Proof of Parikh's Theorem




Cites Work




This page was built for publication: Complete systems of \(\mathcal B\)-rational identities