Conference Information

DCFS 2021: International Conference on Descriptional Complexity of Formal Systems

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Embed deadline badge
DCFS
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:
2021-06-29 Extended
Notification Date:
2021-08-18
Conference Date:
2021-09-03
Location:
Seoul, Korea
Years:
23
Viewed: 15459   Tracked: 0   Attend: 0

Conference Partner Index (CP-I)

49.2 / 100
Ranked #1,790 of 5,687 conferences · Top 32%

#79 of 142 in Theory & Algorithms

Academic recognition (35%) No data - scored at the neutral baseline of 50 —
Submission selectivity (20%) No data - scored at the neutral baseline of 50 —
Editions held (20%)
86
Community attention (10%)
8
Public record completeness (15%)
25

Inputs used: Editions on record: 23 · Researchers who opened this page in the past 24 months: 2

Missing from the public record: Historical acceptance rates (+4.5) · 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 45% - 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-27

Call For Papers

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.
Last updated by Dou Sun on

Related Conferences

Related Journals

CCFFull NameImpact FactorPublisherISSN
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

Comments 0

No comments yet.

Please Login to post a comment