Towards Nominal Formal Languages
Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto
TL;DR
This paper introduces a new class of formal languages over infinite alphabets with binders, extending automata theory to recognize these languages through novel automata models.
Contribution
It defines nominal languages, monoids, and regular expressions, and extends history-dependent automata with stacks to study recognizability of these languages.
Findings
Defined nominal languages, monoids, and regular expressions.
Extended HD-automata with stacks for recognition.
Studied recognizability of nominal languages.
Abstract
We introduce formal languages over infinite alphabets where words may contain binders. We define the notions of nominal language, nominal monoid, and nominal regular expressions. Moreover, we extend history-dependent automata (HD-automata) by adding stack, and study the recognisability of nominal languages.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Logic, programming, and type systems · Formal Methods in Verification