Automata theory in nominal sets

Logical Methods in Computer Science

Volumn 10, Issue 3, 2014, Pages

  Bojańczyk, Mikolaj ^a   Klin, Bartek ^a   Lasota, Sławomir ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Automata; Nominal sets

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

AUTOMATA; AUTOMORPHISM GROUPS; NOMINAL SETS;

AUTOMATA THEORY;

EID: 84940282795     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-10(3:4)2014     Document Type: Article

References (27)

1. J. Adámek and J. Rosický. Locally Presentable and Accessible Categories. Cambridge Univ. Press, 1994.
2. J. Adamek and V. Trnkova. Automata and Algebras in Categories. Kluwer Academic Publishers, 1990.
3. M. Benedikt, C. Ley, and G. Puppis. What you must remember when processing data words. In AMW, volume 619 of CEUR Workshop Proceedings, 2010.
4. H. Björklund and T. Schwentick. On notions of regularity for data languages. TCS, 411(4-5):702-715, 2010.
5. M. Bojanczyk. Data monoids. In STACS, volume 9 of LIPIcs, 2011.
6. M. Bojanczyk, A. Muscholl, T. Schwentick, L. Segoufin, and C. David. Two-variable logic on words with data. In LICS, pages 7-16, 2006.
7. Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, and Slawomir Lasota. Towards nominal computation. In Proc. POPL'12, pages 401-412, 2012.
8. Mikolaj Bojanczyk, Bartek Klin, and Slawomir Lasota. Automata with group actions. In Proc. LICS'11, pages 355-364, 2011.
9. Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, and Szymon Torunczyk. Turing machines with atoms. In Proc. LICS'13, 2013.
10. V. Ciancia. Accessible functors and final coalgebras for named sets. PhD thesis, University of Pisa, 2008.
11. V. Ciancia and E. Tuosto. A novel class of automata for languages on infinite alphabets. Technical Report CS-09-003, University of Leicester, 2009.
12. Stéphane Demri and Ranko Lazic. LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log., 10(3), 2009.
13. D. Figueira, P. Hofman, and S. Lasota. Relating timed and register automata. In Proc. EXPRESS'10, volume 41 of Electronic Proceedings in Theoretical Computer Science, pages 61-75, 2010.
14. N. Francez and M. Kaminski. Finite-memory automata. TCS, 134(2):329-363, 1994.
15. N. Francez and M. Kaminski. An algebraic characterization of deterministic regular languages over infinite alphabets. TCS, 306(1-3):155-175, 2003.
16. M. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Asp. Comput., 13(3-5):341-363, 2002.
17. F. Gadducci, M. Miculan, and U. Montanari. About permutation algebras, (pre)sheaves and named sets. Higher-Order and Symbolic Computation, 19(2-3):283-304, 2006.
18. W. Hodges. A shorter model theory. Cambridge Univ. Press, 1997.
19. J. Hubička and J. Nešetřil. Universal partial order represented by means of oriented trees and other simple graphs. Eur. J. Comb., 26:765-778, 2005.
20. S. Mac Lane and I. Moerdijk. Sheaves in geometry and logic: a first introduction to topos theory. Springer, 1992.
21. U. Montanari and M. Pistore. History-dependent automata: An introduction. In SFM, volume 3465 of Lecture Notes in Computer Science, pages 1-28, 2005.
22. F. Neven, T. Schwentick, and V. Vianu. Towards regular languages over infinite alphabets. In MFCS, volume 2136 of Lecture Notes in Computer Science, pages 560-572, 2001.
23. M. Pistore. History Dependent Automata. PhD thesis, University of Pisa, 1999.
24. Andrew Pitts. Nominal sets: names and symmetry in computer science, volume 57 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2013.
25. R. Rado. Universal graphs and universal functions. Acta Arith., 9:331-340, 1964.
26. L. Segoufin. Automata and logics for words and trees over an infinite alphabet. In CSL, volume 4207 of Lecture Notes in Computer Science, pages 41-57, 2006.
27. S. Staton. Name-passing process calculi: operational models and structural operational semantics. PhD thesis, University of Cambridge, 2007.