会议信息

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

请登录查看会议网址
免费注册：查看官网链接、跟踪截稿日期，并接收邮件提醒。
注册 登录
截稿日期:
2020-10-26 延期
通知日期:
2020-11-23
会议日期:
2021-09-20
会议地点:
Milan, Italy
届数:
14
ICORE: C   QUALIS: B3   浏览: 31820   关注: 4   参加: 0
这一页信息有误？告诉我们
嵌入截止倒计时徽章
LATA
用 API 获取这条数据
搜索与榜单列表完全无需凭证；本页的完整详情需要一把免费 API 密钥。详见开发者接入页。

会伴指数 (CP-I)

59.3 / 100
全站第 631 名 / 共 5,697 个会议 · 前 12%

理论与算法 第 42 / 142

学术认可 (35%)
60
投稿选择性 (20%)
66
会议传承 (20%)
73
社区关注 (10%)
24
资料公开度 (15%)
55

用到的输入: 收录等级：ICORE C, QUALIS B3 · 录用率：40.5%（有记录的 5 届的均值） · 有据可查的届次：14 · 在会伴关注它的研究者：4 人 · 过去 24 个月打开过本页的研究者：2 人

公开资料里还缺: 历届信息 (+3.0) · 最佳论文记录 (+2.3)
主办方认领本会议后，可直接在这一页补上；分数每晚重算。如何提升这个分数

置信度 100% —— 分数中有多大比例来自实际观测到的数据，而不是中性基准。 这个分数是怎么算出来的 · 查看完整榜单 · 算法版本 1.1 · 算于 2026-10-12

征稿

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
由 Dou Sun 最后更新于

录用率

平均录用率: 40.4% 11 年间 (2011–2021).

年份提交数录用数录用率(%)
2021522650%
2020592644.1%
2019983131.6%
2018582034.5%
2017733142.5%
20161194235.3%
20151155346.1%
20141164538.8%
2013974546.4%
20121144136%
2011913639.6%

相关会议

相关期刊

CCF全称影响因子出版商ISSN
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

评论 0

暂无评论。

请登录后发表评论