no code implementations • 12 Sep 2019 • Yi Xiao, Emilio Tuosto
This class of automata captures nominal regular languages; analogously to the classical language theory, nominal automata have been shown to characterise nominal regular expressions with binders.