scientific article; zbMATH DE number 1304993
From MaRDI portal
Publication:4251915
zbMath0940.68085MaRDI QIDQ4251915
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (57)
Varieties and covarieties of languages (extended abstract) ⋮ Linearization of automatic arrays and weave specifications ⋮ Soundness and completeness proofs by coinductive methods ⋮ Characterising Behavioural Equivalence: Three Sides of One Coin ⋮ Semantic Foundations for Deterministic Dataflow and Stream Processing ⋮ A symbolic decision procedure for symbolic alternating finite automata ⋮ Behavioural differential equations: a coinductive calculus of streams, automata, and power series ⋮ Distributivity of categories of coalgebras ⋮ Unnamed Item ⋮ Deciding Regular Expressions (In-)Equivalence in Coq ⋮ Left-Handed Completeness ⋮ On Coalgebras over Algebras ⋮ Proof Pearl: regular expression equivalence and relation algebra ⋮ Subsequential transducers: a coalgebraic perspective ⋮ A bialgebraic approach to automata and formal language theory ⋮ Formalization of Data Flow Computing and a Coinductive Approach to Verifying Flowware Synthesis ⋮ A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity ⋮ Proving language inclusion and equivalence by coinduction ⋮ Modalities in the Stone age: a comparison of coalgebraic logics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bisimulations for fuzzy automata ⋮ Nondeterministic automata: equivalence, bisimulations, and uniform relations ⋮ Verified decision procedures for MSO on words based on derivatives of regular expressions ⋮ On coalgebras over algebras ⋮ A description based on languages of the final non-deterministic automaton ⋮ Friends with Benefits ⋮ A Single Complete Relational Rule for Coalgebraic Refinement ⋮ On minimal coalgebras ⋮ On the Coalgebraic Theory of Kleene Algebra with Tests ⋮ Combining semilattices and semimodules ⋮ The dual equivalence of equations and coequations for automata ⋮ From Grammars and Automata to Algebras and Coalgebras ⋮ Automata Learning: A Categorical Perspective ⋮ Ramified Corecurrence and Logspace ⋮ Product Rules and Distributive Laws ⋮ A coalgebraic approach to Kleene algebra with tests ⋮ A coalgebraic presentation of structured transition systems ⋮ Automata and fixed point logic: a coalgebraic perspective ⋮ A note on Coinduction and Weak Bisimilarity for While Programs ⋮ A compositional treatment of iterated open games ⋮ On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions ⋮ Left-handed completeness ⋮ A Kleene Theorem for Polynomial Coalgebras ⋮ Equational Coalgebraic Logic ⋮ A New Foundation for Finitary Corecursion ⋮ A new foundation for finitary corecursion and iterative algebras ⋮ Types from Frames as Finite Automata ⋮ Two extensions of system F with (co)iteration and primitive (co)recursion principles ⋮ Universal coalgebra: A theory of systems ⋮ Context-free coalgebras ⋮ Coalgebraic semantics for nominal automata ⋮ Deciding Kleene algebra terms equivalence in Coq ⋮ CSP, partial automata, and coalgebras. ⋮ Coalgebraising Subsequential Transducers ⋮ Control of discrete-event systems with partial observations using coalgebra and coinduction
This page was built for publication:
