Información de la conferencia

DCFS 2021: International Conference on Descriptional Complexity of Formal Systems

Por favor Iniciar sesión para ver el sitio web de la conferencia
Cuenta gratuita: consulta los sitios oficiales, sigue las fechas límite y recibe recordatorios por correo.
Iniciar sesión Registrarse

Día de Entrega:
2021-06-29 Extended
Fecha de Notificación:
2021-08-18
Fecha de conferencia:
2021-09-03
Ubicación:
Seoul, Korea
Ediciones:
23
Vistas: 14576   Seguidores: 0   Asistentes: 0

Solicitud de Artículos

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.
Última actualización por Dou Sun el

Conferencias Relacionadas

CCFICOREQUALISAbreviaciónNombre CompletoEntregaNotificaciónFecha de conferencia
AA*A1SIGIRInternational Conference on Research and Development in Information Retrieval2026-01-152026-04-022026-07-20
AA*A1AAAIAAAI Conference on Artificial Intelligence2026-07-212026-11-302027-02-16
AA*A1CVPRIEEE Conference on Computer Vision and Pattern Recognition2025-11-062026-02-202026-06-03
BA*A1ICRAInternational Conference on Robotics and Automation2025-09-152026-06-01
BA*A1IJCAIInternational Joint Conference on Artificial Intelligence2026-01-312026-08-15
AA*A1STOCACM Symposium on Theory of Computing2025-11-042026-02-012026-06-22
CA2ICCInternational Conference on Communications2026-10-022027-01-152027-05-30
CBA2IJCNNInternational Joint Conference on Neural Networks2025-01-152025-03-312025-06-30
BA1ICASSPInternational Conference on Acoustics, Speech and Signal Processing2026-09-162027-01-132027-05-16
BA*A1PODSACM SIGMOD Conference on Principles of DB Systems2026-12-032027-03-012027-06-13

Revistas Relacionadas

CCFNombre CompletoFactor de ImpactoEditorISSN
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 Systems6.1Elsevier0167-739X
CNeurocomputing6.5Elsevier0925-2312
CPattern Recognition Letters3.9Elsevier0167-8655
BPattern Recognition7.6Elsevier0031-3203
IEEE Access3.6IEEE2169-3536

Comentarios 0

Aún no hay comentarios.

Por favor Iniciar sesión para publicar un comentario