Mikołaj Bojańczyk > Syntactic Automata and Algebras for Infinite Alphabets

Syntactic Automata and Algebras for Infinite Alphabets

Warsaw, September 27-28 2010. The meeting is funded by AutomathA.

Topic

The meeting is devoted to syntactic automata and monoids for languages over infinite alphabets. A long term goal is to use these syntactic structures for effective characterizations. The meeting is intended to be an informal exchange of ideas, with a lot of blackboard discussion. One of the goals is to arrive at a common notation and a common set of problems to work on.

Practical information

The meeting will be in the Institute of Informatics, University of Warsaw. It is most convenient to reach the department by bus from the airport, 18 minutes by bus and 10 minutes walking. The buses are 188 or 175, here is a schedule for this trip. On the bus stop at the airport there is a vending machine selling tickets. (There is a vending machine also on some, but not all, buses with number 175). Look out for your wallet, there might be pickpockets on this particular bus line, but not on others.

Abstract schedule

Monday, 27 September

1:00-2:00 Lunch

2:00-3:45 Talks and discussion

3:45-4:15 Coffee break

4:15-6:00 Talks and discussion

7:00 Dinner

Tuesday, 28 September

9:00-10:00 Talks and discussion

10:00-10:30 Coffee break

10:30--1:00 Talks and discussion

1:00-2:00 Lunch, ending