A Kleene theorem for nominal automata

DOI10.4230/LIPICS.ICALP.2019.107MaRDI QIDQ5091269zbMATH OpenFDO

Authors Paul Brunet, Alexandra Silva

Publication date 21 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2019.107

zbMATH Keywords

bracket algebraKleene theoremnominal automata

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Recommendations

• On nominal regular languages with binders
• A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
• Nominal automata with name binding
• Automata theory in nominal sets
• Learning nominal automata

Cites work

• A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
• A formal exploration of nominal Kleene algebra
• A robust class of data languages and an application to learning
• Automata for XML -- a survey
• Automata theory in nominal sets
• Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6--10, 2015. Proceedings. Part II
• Completeness and incompleteness in nominal Kleene algebra
• Finite state machines for strings over infinite alphabets
• Finite-memory automata
• scientific article; zbMATH DE number 2086669 (Why is no real title available?)
• Leaving the nest: nominal techniques for variables with interleaving scopes
• Nominal automata with name binding
• Nominal monoids
• Nominal sets. Names and symmetry in computer science
• On nominal regular languages with binders
• Polynomial-time equivalence testing for deterministic fresh-register automata
• Regular expressions for data words

Cited in

(2)

• Kleene theorems for free choice automata over distributed alphabets
• scientific article; zbMATH DE number 1390065 (Why is no real title available?)

This page was built for publication: A Kleene theorem for nominal automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091269)