scientific article; zbMATH DE number 7559500

DOI10.4230/LIPIcs.CONCUR.2020.44MaRDI QIDQ5089311

Joshua Moerman, Matteo Sammartino

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

lattice theorydecidabilityclosureexact learningresidual automatanominal automataderivative language

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
• Coalgebraic constructions of canonical nondeterministic automata
• Learning regular sets from queries and counterexamples
• Finite-memory automata
• Combining black-box and white-box techniques for learning register automata
• Nominal Sets
• Automata theory in nominal sets
• On Nominal Regular Languages with Binders
• A Robust Class of Data Languages and an Application to Learning
• Towards nominal computation
• Nominal Automata with Name Binding
• Freshness and Name-Restriction in Sets of Traces with Names
• FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT
• Stone Duality for Nominal Boolean Algebras with И
• Linear Automaton Transformations
• Nominal Kleene Coalgebra
• Learning Theory
• The Containment Problem for Unambiguous Register Automata
• On computability and tractability for infinite sets
• Finite state machines for strings over infinite alphabets
• Runtime Verification Based on Register Automata
• LOIS: syntax and semantics
• Learning nominal automata
• Unambiguity in Automata Theory

This page was built for publication: