Publishing Partner: Cambridge University Press CUP Extra Publisher Login
amazon logo
More Info


E-mail this page

Conference Information



Full Title: 11th International Conference on Language and Automata Theory and Applications

      
Short Title: LATA 2017
Location: Umeå, Sweden
Start Date: 06-Mar-2017 - 10-Mar-2017
Contact: Florentina Lilica Voicu
Meeting Email: click here to access email
Meeting URL: http://grammars.grlmc.com/LATA2017/
Meeting Description: Aims:

LATA is a conference series on theoretical computer science and its applications. Following the tradition of the diverse PhD training events in the field organized by Rovira i Virgili University since 2002, LATA 2017 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from classical theory fields as well as application areas.

Venue:

LATA 2017 will take place in Umeå, a university town in North Sweden which was European Capital of Culture in 2014. The venue will be the Faculty of Science and Technology.

Scope:

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

- Algebraic language theory
- Algorithms for semi-structured data mining
- Algorithms on automata and words
- Automata and logic
- Automata for system analysis and programme verification
- Automata networks
- Automatic structures
- Codes
- Combinatorics on words
- Computational complexity
- Concurrency and Petri nets
- Data and image compression
- Descriptional complexity
- Foundations of finite state technology
- Foundations of XML
- Grammars (Chomsky hierarchy, contextual, unification, categorial, etc.)
- Grammatical inference and algorithmic learning
- Graphs and graph transformation
- Language varieties and semigroups
- Language-based cryptography
- Mathematical and logical foundations of programming methodologies
- Parallel and regulated rewriting
- Parsing
- Patterns
- Power series
- String processing algorithms
- Symbolic dynamics
- Term rewriting
- Transducers
- Trees, tree languages and tree automata
- Weighted automata

Structure:

LATA 2017 will consist of:

Invited talks
Peer-reviewed contributions

Invited Speakers:

- Franz Baader (Technical University of Dresden), Approximately Description Logics
- Thomas Eiter (Technical University of Vienna), Stream Reasoning: Issues and Some Results
- Michael R. Fellows (University of Bergen), On Some Finiteness Theorems about Formal Languages
- Georg Gottlob (University of Oxford), Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data
- Thomas Wilke (University of Kiel), Backward Deterministic omega-Automata

Organized by:

Department of Computing Science
Umeå University

Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Linguistic Subfield: Computational Linguistics
LL Issue: 27.4265


Back
Calls and Conferences main page