会议信息

DCFS 2021: International Conference on Descriptional Complexity of Formal Systems

请登录查看会议网址
免费注册：查看官网链接、跟踪截稿日期，并接收邮件提醒。
注册 登录
嵌入截止倒计时徽章
DCFS
用 API 获取这条数据
搜索与榜单列表完全无需凭证；本页的完整详情需要一把免费 API 密钥。详见开发者接入页。
截稿日期:
2021-06-29 Extended
通知日期:
2021-08-18
会议日期:
2021-09-03
会议地点:
Seoul, Korea
届数:
23
浏览: 15463   关注: 0   参加: 0

会伴指数 (CP-I)

49.2 / 100
全站第 1,790 名 / 共 5,687 个会议 · 前 32%

理论与算法 第 79 / 142

学术认可 (35%) 无数据 —— 按中性基准 50 分计入 —
投稿选择性 (20%) 无数据 —— 按中性基准 50 分计入 —
会议传承 (20%)
86
社区关注 (10%)
8
资料公开度 (15%)
25

用到的输入: 有据可查的届次：23 · 过去 24 个月打开过本页的研究者：2 人

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

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

征稿

DCFS 2021 (International Conference on Descriptional Complexity of Formal Systems) is an academic conference held in Seoul, Korea on 2021-09-03. The paper submission deadline is 2021-06-29 (extended). Acceptance notifications are sent on 2021-08-18.

TOPICS Submissions concerning the descriptional complexity of formal systems and structures (and its applications) are invited for DCFS 2021. Original papers are sought in all aspects of descriptional complexity, topics include, but are not limited to: Automata, grammars, languages and other formal systems; various modes of operations and complexity measures. Succinctness of description of objects, state-explosion-like phenomena. Circuit complexity of Boolean functions and related measures. Size complexity of formal systems. Structural complexity of formal systems. Trade-offs between computational models and mode of operation. Applications of formal systems - for instance in software and hardware testing, in dialogue systems, in systems modeling or in modeling natural languages - and their complexity constraints. Co-operating formal systems. Size or structural complexity of formal systems for modeling natural languages. Complexity aspects related to the combinatorics of words. Descriptional complexity in resource-bounded or structure-bounded environments. Structural complexity as related to descriptional complexity. Frontiers between decidability and undecidability. Universality and reversibility. Nature-motivated (bio-inspired) architectures and unconventional models of computing. Blum Static (Kolmogorov/Chaitin) complexity, algorithmic information.
由 Dou Sun 最后更新于

相关会议

相关期刊

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

暂无评论。

请登录后发表评论