AUTOMATA THEORY IN NOMINAL SETS

被引：68

作者：

Bojanczyk, Mikolaj ^{[1
]}

Klin, Bartek ^{[1
]}

Lasota, Slawomir ^{[1
]}

机构：

[1] Univ Warsaw, PL-00325 Warsaw, Poland

来源：

LOGICAL METHODS IN COMPUTER SCIENCE | 2014年 / 10卷 / 03期

关键词：

Nominal sets; automata; WORDS; TREES;

D O I：

10.2168/LMCS-10(3:4)2014

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an automorphism group of the alphabet. In the process, we generalize nominal sets due to Gabbay and Pitts.

引用

页数：44

共 27 条

[1]

Adamek J., 1994, LMS LECT NOTE SERIES

[2]

Adamek Jiri., 1990, AUTOMATA ALGEBRAS CA

[3]

[Anonymous], CEUR WORKSHOP P

[4] On notions of regularity for data languages [J].

Bjorklund, Henrik ;

Schwentick, Thomas .

THEORETICAL COMPUTER SCIENCE, 2010, 411 (4-5) :702-715

[5]

BOJANCZYK M, 2012, P 39 ACM SIGPLAN SIG, V47, P401

[6]

Bojanczyk M., 2011, LIPICS, V9

[7] Two-variable logic on words with data [J].

Bojanczyk, MikolaJ ;

Muscholl, Anca ;

Schwentick, Thomas ;

Segoufin, Luc ;

David, Claire .

21ST ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2006, :7-+

[8] Automata with group actions [J].

Bojanczyk, Mikolaj ;

Klin, Bartek ;

Lasota, Slawomir .

26TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2011), 2011, :355-364

[9]

Bojanczyk Mikolaj, 2013, P LICS 13

[10]

Ciancia V., 2008, THESIS U PISA

← 1 2 3 →