Nominal Kleene Coalgebra
From MaRDI portal
Publication:3449483
DOI10.1007/978-3-662-47666-6_23zbMath1440.68174OpenAlexW1513180883MaRDI QIDQ3449483
Alexandra Silva, Konstantinos Mamouras, Dexter Kozen, Daniela Petrişan
Publication date: 4 November 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-47666-6_23
Logic in computer science (03B70) Algebraic theory of languages and automata (68Q70) Abstract data types; algebraic specification (68Q65)
Related Items
Nominal Kleene Coalgebra ⋮ Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets ⋮ Left-Handed Completeness ⋮ Completeness and incompleteness in nominal Kleene algebra ⋮ Exploring nominal cellular automata ⋮ Unnamed Item ⋮ A Theory of Formal Choreographic Languages ⋮ Unnamed Item ⋮ Equational Theories of Abnormal Termination Based on Kleene Algebra ⋮ Nominal Automata with Name Binding ⋮ Unnamed Item ⋮ Initial Algebras of Terms with Binding and Algebraic Structure ⋮ Realization of Coinductive Types ⋮ A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors ⋮ Unnamed Item ⋮ Quantitative simulations by matrices ⋮ Left-handed completeness ⋮ Reversible Kleene lattices ⋮ Coalgebraic semantics for nominal automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite-memory automata
- On final coalgebras of continuous functors
- An algebraic characterization of deterministic regular languages over infinite alphabets.
- A Coalgebraic Decision Procedure for NetKAT
- Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests
- Nominal Sets
- Automata theory in nominal sets
- Deciding Kleene Algebras in Coq
- On Nominal Regular Languages with Binders
- A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
- Checking NFA equivalence with bisimulations up to congruence
- Freshness and Name-Restriction in Sets of Traces with Names
- Foundations of Nominal Techniques: Logic and Semantics of Variables in Abstract Syntax
- On the Coalgebraic Theory of Kleene Algebra with Tests
- Nominal Kleene Coalgebra
- Completeness and Incompleteness in Nominal Kleene Algebra
- Position Automata for Kleene Algebra with Tests
- Algebra and Coalgebra in Computer Science
- A Unified Construction of the Glushkov, Follow, and Antimirov Automata
This page was built for publication: Nominal Kleene Coalgebra