Nominal Automata with Name Binding
From MaRDI portal
Publication:2988364
DOI10.1007/978-3-662-54458-7_8zbMath1486.68097arXiv1603.01455OpenAlexW2295804767MaRDI QIDQ2988364
Dexter Kozen, Stefan Milius, Thorsten Wißmann, Lutz Schröder
Publication date: 19 May 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.01455
Related Items (6)
Unnamed Item ⋮ From generic partition refinement to weighted tree automata minimization ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A coalgebraic view on reachability ⋮ Coalgebraic semantics for nominal automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Walking on data words
- Finite-memory automata
- Universal coalgebra: A theory of systems
- A fully abstract denotational semantics for the \(\pi\)-calculus
- Regular expressions for data words
- History-Register Automata
- Nominal Sets
- Completeness Results for Parameterized Space Classes
- Automata theory in nominal sets
- On Nominal Regular Languages with Binders
- A Robust Class of Data Languages and an Application to Learning
- LTL with the freeze quantifier and register automata
- Freshness and Name-Restriction in Sets of Traces with Names
- Foundations of Nominal Techniques: Logic and Semantics of Variables in Abstract Syntax
- FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT
- Nominal Kleene Coalgebra
- Completeness and Incompleteness in Nominal Kleene Algebra
- Variable Automata over Infinite Alphabets
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Nominal Domain Theory for Concurrency
- Finite state machines for strings over infinite alphabets
- Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes
- Fresh-register automata
- Unambiguity in Automata Theory
This page was built for publication: Nominal Automata with Name Binding
