On Nominal Regular Languages with Binders

On Nominal Regular Languages with Binders
复制标题

关于带有活页夹的名义正则语言

DOI:
--
复制
发表时间:
2012
期刊:
Foundations of Software Science and Computation Structure
影响因子:
--
通讯作者:
E. Tuosto
E. Tuosto
中科院分区:
--
文献类型:
--
作者:
A. Kurz;Tomoyuki Suzuki;E. Tuosto

文献摘要

被引文献

相似文献

我们在无限字母表上研究规则语言,其中单词可能包含名称上的粘合剂。为此,经典正则表达式和自动机被扩展为绑定器。证明了约束约束上的有限自动机与正则表达式的等价性,研究了约束约束下正则语言的闭包性质和互补。
We investigate regular languages on infinite alphabets where words may contain binders on names. To this end, classical regular expressions and automata are extended with binders. We prove the equivalence between finite automata on binders and regular expressions with binders and investigate closure properties and complementation of regular languages with binders.