Automata with group actions

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2011, Pages 355-364

  Bojańczyk, Mikołaj ^a   Klin, Bartek ^a,b   Lasota, Sławomir ^a  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMORPHISM GROUPS; EXPRESSIVE POWER; FINITE MEMORY; GROUP ACTIONS; MYHILL-NERODE THEOREM; NOMINAL SETS; PARTIAL ORDER; TOTAL ORDER;

COMPUTABILITY AND DECIDABILITY; COMPUTER SCIENCE;

AUTOMATA THEORY;

EID: 80052155671     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2011.48     Document Type: Conference Paper

References (21)

1. J. Adamek and V. Trnkova. Automata and Algebras in Categories. Kluwer Academic Publishers, 1990.
2. M. Benedikt, C. Ley, and G. Puppis. What you must remember when processing data words. In AMW, 2010.
3. H. Björklund and T. Schwentick. On notions of regularity for data languages. TCS, 411(4-5):702-715, 2010.
4. M. Bojańczyk. Data monoids. In STACS, 2011.
5. M. Bojańczyk, A. Muscholl, T. Schwentick, L. Segoufin, and C. David. Two-variable logic on words with data. In LICS, pages 7-16, 2006. (Pubitemid 47130347)
6. V. Ciancia. Accessible functors and final coalgebras for named sets. PhD thesis, University of Pisa, 2008.
7. V. Ciancia and E. Tuosto. A novel class of automata for languages on infinite alphabets. Technical Report CS-09-003, University of Leicester, 2009.
8. S. Demri and R. Lazic. LTL with the freeze quantifier and register automata. In LICS, pages 17-26, 2006. (Pubitemid 47130348)
9. G. L. Ferrari, U. Montanari, and M. Pistore. Minimizing transition systems for name passing calculi: A co-algebraic formulation. In FoSSaCS, volume 2303 of LNCS, pages 129-158, 2002.
10. D. Figueira, P. Hofman, and S. Lasota. Relating timed and register automata. In Proc. EXPRESS'10, volume 41 of EPTCS, pages 61-75, 2010.
11. R. Fraïssé. Theory of relations. North-Holland, 1953.
12. N. Francez and M. Kaminski. Finite-memory automata. TCS, 134(2):329-363, 1994.
13. N. Francez and M. Kaminski. An algebraic characterization of deterministic regular languages over infinite alphabets. TCS, 306(1-3):155-175, 2003.
14. M. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Asp. Comput., 13(3-5):341-363, 2002. (Pubitemid 41204157)
15. 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.
16. 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. (Pubitemid 40272582)
17. U. Montanari and M. Pistore. History-dependent automata: An introduction. In SFM, pages 1-28, 2005. (Pubitemid 41312734)
18. F. Neven, T. Schwentick, and V. Vianu. Towards regular languages over infinite alphabets. In MFCS, pages 560-572, 2001. (Pubitemid 33322443)
19. M. Pistore. History Dependent Automata. PhD thesis, University of Pisa, 1999.
20. L. Segoufin. Automata and logics for words and trees over an infinite alphabet. In CSL, pages 41-57, 2006. (Pubitemid 44617548)
21. S. Staton. Name-passing process calculi: operational models and structural operational semantics. PhD thesis, University of Cambridge, 2007.