20.245 events: Language and Automata Theory

               Humanist Discussion Group, Vol. 20, No. 245.
       Centre for Computing in the Humanities, King's College London
  www.kcl.ac.uk/schools/humanities/cch/research/publications/humanist.html
                        www.princeton.edu/humanist/
                     Submit to: humanist_at_princeton.edu

         Date: Mon, 09 Oct 2006 05:41:11 +0100
         From: <carlos.martin_at_urv.cat>
         Subject: LATA 2007: 2nd call for papers

****************************************************************************=

2nd Call for Papers

1st INTERNATIONAL CONFERENCE ON LANGUAGE AND
AUTOMATA THEORY AND APPLICATIONS (LATA 2007)

Tarragona, Spain, March 29 - April 4, 2007

http://www.grammars.grlmc.com/LATA2007/

****************************************************************************=

AIMS:

LATA 2007 intends to become a major conference in
theoretical computer science and its
applications. As linked to the International PhD
School in Formal Languages and Applications that
is being developed at the host institute since
2001, it will reserve significant room for young
computer scientists at the beginning of their
career. LATA 2007 will aim at attracting scholars
from both classical theory fields and application
areas (bioinformatics, systems biology, language
technology, artificial intelligence, etc.).

SCOPE:

Topics of either theoretical or applied interest
include, but are not limited to:

- words, languages and automata
- grammars (Chomsky hierarchy, contextual,
multidimensional, unification, categorial, etc.)
- grammars and automata architectures
- combinatorics on words
- language varieties and semigroups
- algebraic language theory
- computability
- computational, descriptional, communication and parameterized complexity
- patterns and codes
- regulated rewriting
- trees, tree languages and tree machines
- term rewriting
- graphs and graph transformation
- power series
- fuzzy and rough languages
- cellular automata
- DNA and other models of bio-inspired computing
- quantum, chemical and optical computing
- biomolecular nanotechnology
- automata and logic
- automata for verification
- automata, concurrency and Petri nets
- parsing
- weighted machines
- foundations of finite state technology
- grammatical inference and learning
- symbolic neural networks
- text retrieval and pattern recognition
- string and combinatorial issues in computational biology and=
  bioinformatics
- mathematical evolutionary genomics
- language-based cryptography
- compression
- circuit theory and applications
- language theoretic foundations of artificial intelligence and artificial=
  life

STRUCTURE:

LATA 2007 will consist of:

- 3 invited talks
- 2 invited tutorials
- refereed contributions
- open sessions for discussion in specific subfields
- young sessions on professional issues

INVITED SPEAKERS:

Volker Diekert (UStuttgart), Equations: From Words to Graph Products=
  (tutorial)
Nissim Francez & Michael Kaminski (Technion),
Extensions of Pregroup Grammars and Their Correlated Automata
Eric Graedel (RWTH Aachen), Infinite Games (tutorial)
Neil Immerman (UMass, Amherst), Nested Words
Helmut J=FCrgensen (UWestern Ontario),
Synchronization and Codes (tentative title)

[...]
Received on Tue Oct 10 2006 - 02:34:12 EDT