Conference Information

LATA 2021: International Conference on Language and Automata Theory and Applications

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Embed deadline badge
LATA
Get this via API
Search and ranking lists need no credentials at all; full detail for this page needs a free API key. See the developer guide.
Submission Date:
2020-10-26 Extended
Notification Date:
2020-11-23
Conference Date:
2021-09-20
Location:
Milan, Italy
Years:
14
ICORE: C   QUALIS: B3   Viewed: 31478   Tracked: 4   Attend: 0

Conference Partner Index (CP-I)

59.3 / 100
Ranked #604 of 5,652 conferences · Top 11%

#35 of 138 in Theory & Algorithms

Academic recognition (35%)
60
Submission selectivity (20%)
66
Editions held (20%)
73
Community attention (10%)
24
Public record completeness (15%)
55

Inputs used: Listed as ICORE C, QUALIS B3 · Acceptance rate: 40.5% (mean of 5 editions on file) · Editions on record: 14 · Researchers following it here: 4 · Researchers who opened this page in the past 24 months: 2

Missing from the public record: Past editions (+3.0) · Best-paper records (+2.3)
Organizers can add these from this page after claiming the conference; scores are recomputed nightly. How to raise this score

Confidence 100% - the share of the score backed by observed data rather than the neutral baseline. How this score is calculated · Browse the ranking · Algorithm version 1.1 · Computed 2026-09-08

Call For Papers

LATA 2021 (International Conference on Language and Automata Theory and Applications) is a ICORE C / QUALIS B3 conference held in Milan, Italy on 2021-09-20. The paper submission deadline is 2020-10-26 (extended). Acceptance notifications are sent on 2020-11-23.

AIMS LATA is a conference series on theoretical computer science and its applications. LATA 2020 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. 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, inductive 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
Last updated by Dou Sun on

Acceptance Ratio

Average acceptance rate: 40.4% over 11 years (2011–2021).

YearSubmittedAcceptedAccepted(%)
2021522650%
2020592644.1%
2019983131.6%
2018582034.5%
2017733142.5%
20161194235.3%
20151155346.1%
20141164538.8%
2013974546.4%
20121144136%
2011913639.6%

Related Conferences

Related Journals

CCFFull NameImpact FactorPublisherISSN
Journal of Control Theory and Applications1.5Springer1672-6340
AIEEE Transactions on Multimedia9.7IEEE1520-9210
CKnowledge-Based Systems7.2Elsevier0950-7051
BSoftware & Systems Modeling3.2Springer1619-1366
AIEEE Transactions on Computers3.8IEEE0018-9340
CFuture Generation Computer Systems5.9Elsevier0167-739X
CNeurocomputing6.5Elsevier0925-2312
CPattern Recognition Letters3.9Elsevier0167-8655
BPattern Recognition7.6Elsevier0031-3203
IEEE Access3.6IEEE2169-3536

Comments 0

No comments yet.

Please Login to post a comment