
THE
FIELDS INSTITUTE FOR RESEARCH IN MATHEMATICAL SCIENCES 
July
2225, 2013,
15th Workshop on
Descriptional Complexity of Formal Systems
( DCFS 2013)


WORKSHOP SCIENTIFIC AREA
The theories of automata, grammars and related formal systems are cornerstones
of the theoretical foundations of computer science. Issues concerning the
descriptional complexity of such formal systems have an immediate influence
on their application to modelling physical systems. The problem areas to be
addressed include, but are not limited to, the following:
 Automata, grammars, languages and other formal systems; various
modes of operations and complexity measures.
 Succinctness of description of objects, stateexplosionlike
phenomena.
 Circuit complexity of Boolean functions and related measures.
 Size complexity of formal systems.
 Structural complexity of formal systems.
 Tradeoffs between computational models and mode of operation.
 Applications of formal systems  for instance in software and
hardware testing, in dialogue systems, in systems modelling or
in modelling natural languages and their complexity constraints.
 Cooperating formal systems.
 Size or structural complexity of formal systems for modelling
natural languages.
 Complexity aspects related to the combinatorics of words.
 Descriptional complexity in resourcebounded or structurebounded
environments.
 Structural complexity as related to descriptional complexity.
 Frontiers between decidability and undecidability.
 Universality and reversibility.
 Naturemotivated (bioinspired) architectures and unconventional
models of computing.
 KolmogorovChaitin complexity, algorithmic information.
Top

