A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
From MaRDI portal
Publication:5757938
Recommendations
Cited in
(37)- Steps and traces
- Deterministic biautomata and subclasses of deterministic linear languages
- Left-handed completeness
- A new foundation for finitary corecursion and iterative algebras
- Distributive laws for the coinductive solution of recursive equations
- Processes as formal power series: a coinductive approach to denotational semantics
- Non-deterministic Kleene coalgebras
- A new foundation for finitary corecursion. The locally finite fixpoint and its properties
- Left-handed completeness
- Stream differential equations: specification formats and solution methods
- Pointwise extensions of GSOS-defined operations
- From grammars and automata to algebras and coalgebras
- Deriving Syntax and Axioms for Quantitative Regular Behaviours
- Bideterministic Automata and Minimal Representations of Regular Languages
- A Bialgebraic Approach to Automata and Formal Language Theory
- A bialgebraic approach to automata and formal language theory
- scientific article; zbMATH DE number 7438576 (Why is no real title available?)
- Quantitative Kleene coalgebras
- Initial algebras of terms with binding and algebraic structure
- Sound and complete axiomatization of trace semantics for probabilistic systems
- Product rules and distributive laws
- Kleene algebra with observations
- Completeness and the finite model property for Kleene algebra, reconsidered
- Bialgebras for structural operational semantics: an introduction
- Minimisation in logical form
- On star expressions and completeness theorems
- Canonical automata via distributive law homomorphisms
- Automata and coalgebras in categories of species
- An elementary proof of the FMP for Kleene algebra
- Behavioural metrics: compositionality of the Kantorovich lifting and an application to up-to techniques
- On propositional program equivalence (extended abstract)
- Automata and coalgebras in categories of species
- Bicategories of automata, automata in bicategories
- A completeness theorem for probabilistic regular expressions
- Well-behaved (co)algebraic semantics of regular expressions in Dafny
- Guarded Kleene algebra with tests: coequations, coinduction, and completeness
- A complete inference system for probabilistic infinite trace equivalence
This page was built for publication: A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757938)
