Data monoids

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 9, Issue , 2011, Pages 105-116

  Bojańczyk, Mikolai ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Data Words; First Order Logic; Monoid; Nominal Set

Indexed keywords

ALGEBRAIC THEORIES; DATA WORDS; FIRST ORDER LOGIC; MONOID; MONOIDS; NOMINAL SET; SYNTACTIC MONOID;

COMPUTER SCIENCE; FORMAL LOGIC;

ALGEBRA;

EID: 80052133286     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2011.105     Document Type: Conference Paper

References (8)

1. Michael Benedikt, Clemens Ley, and Gabriele Puppis. Automata vs. logics on data words. In CSL, pages 110-124, 2010.
2. Michael Benedikt, Clemens Ley, and Gabriele Puppis. What you must remember when processing data words. In AMW, 2010.
3. Patricia Bouyer, Antoine Petit, and Denis Thérien. An algebraic approach to data languages and timed languages. Inf. Comput., 182(2):137-162, 2003.
4. Nissim Francez and Michael Kaminski. An algebraic characterization of deterministic regular languages over infinite alphabets. Theor. Comput. Sci., 306(1-3):155-175, 2003.
5. Murdoch Gabbay and Andrew M. Pitts. A new approach to abstract syntax with variable binding. Formal Asp. Comput., 13(3-5):341-363, 2002.
6. Michael Kaminski and Nissim Francez. Finite-memory automata. Theor. Comput. Sci., 134(2):329-363, 1994.
7. Luc Segoufin. Automata and logics for words and trees over an infinite alphabet. In CSL, pages 41-57, 2006.
8. Howard Straubing. Finite Automata, Formal Languages, and Circuit Complexity. Birkhäuser, Boston, 1994.