Equations with languages as unknowns are among the most natural objects of formal language theory. Equations of many kinds have been studied, both as theoretical concepts and as formal models of various applications. The purpose of this workshop is to bring together researchers working on different aspects of different variants of language equations.
Topics
- Decision problems for language equations: decidability, complexity, algorithms
- Families of languages defined by language equations
- Language equations with various operations
- Different forms of language equations
- Identities on formal languages
- Representation of applied problems by language equations
- Grammars defined by language equations (conjunctive grammars, Boolean grammars, etc.)
- Descriptional complexity of language equations
- Equations on sets of terms (set constraints)
Call for papers
Papers presenting original contributions on language equations and related subjects are being sought. Authors are invited to submit papers of no more than 12 pages in electronic format (PostScript or PDF). The submissions are handled by the EasyChair conference management system.
To access the TALE 2007 submission system, follow this link:Submissions should be received by April 18, 2007. Submissions will be reviewed by the Program Committee. The proceedings volume will be published by Turku Centre for Computer Science in its General Publications series.
http://www.easychair.org/TALE2007/
Submission is closed.
Important dates
Paper submission: April 11, 2007 April 18, 2007 (extended deadline)
Notification: May 11, 2007 May 28, 2007
Final copy: June 11, 2007
The workshop: July 2, 2007
Invited speakers
Witold Charatonik (Wroclaw, Poland)
Werner Kuich (Vienna, Austria)
Nina Yevtushenko (Tomsk, Russia)
Programme committee
Juhani Karhumäki (Turku, Finland)
Michal Kunc (Brno, Czech Republic, acting chairman)
Alexander Okhotin (Turku, Finland, chairman)
Kai Salomaa (Kingston, Canada)
Sophie Tison (Lille, France)