DeepAI AI Chat
Log In Sign Up

Coalgebraic Semantics for Nominal Automata

by   Florian Frank, et al.

This paper provides a coalgebraic approach to the language semantics of two types of non-deterministic automata over nominal sets: non-deterministic orbit-finite automata (NOFAs) and regular nominal non-deterministic automata (RNNAs), which were introduced in previous work. While NOFAs are a straightforward nominal version of non-deterministic automata, RNNAs feature ordinary as well as name binding transitions. Correspondingly, words accepted by RNNAs are strings formed by ordinary letters and name binding letters. Bar languages are sets of such words modulo α-equivalence, and to every state of an RNNA one associates its accepted bar language. We show that the semantics of NOFAs and RNNAs, respectively, arise both as an instance of the Kleisli-style coalgebraic trace semantics as well as an instance of the coalgebraic language semantics obtained via generalized determinization. On the way we revisit coalgebraic trace semantics in general and give a new compact proof for the main result in that theory stating that an initial algebra for a functor yields the terminal coalgebra for the Kleisli extension of the functor. Our proof requires fewer assumptions on the functor than all previous ones.


Convex Language Semantics for Nondeterministic Probabilistic Automata

We explore language semantics for automata combining probabilistic and n...

A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages

We propose a new symbolic trace semantics for register automata (extende...

One-way resynchronizability of word transducers

The origin semantics for transducers was proposed in 2014, and led to va...

The Algebra of Nondeterministic Finite Automata

A process algebra is proposed, whose semantics maps a term to a nondeter...

Minimisation in Logical Form

Stone-type dualities provide a powerful mathematical framework for study...

Trace Semantics for Nondeterministic Probabilistic Automata via Determinization

This paper studies trace-based equivalences for automata combining nonde...

Outfix-guided insertion

Motivated by work on bio-operations on DNA strings, we consider an outfi...