Descriptional Complexity of Formal Systems

Descriptional Complexity of Formal Systems
Abbreviation DCFS
Discipline Automata theory and formal languages
Publication details
Publisher Lecture Notes in Computer Science
History 1999–
Frequency annual

DCFS, the International Workshop on Descriptional Complexity of Formal Systems is an annual academic conference in the field of computer science.

Beginning with the 2011 edition, the proceedings of the workshop appear in the series Lecture Notes in Computer Science. Already since the very beginning, extended versions of selected papers are published as special issues of the International Journal of Foundations of Computer Science, the Journal of Automata, Languages and Combinatorics, and of Theoretical Computer Science. In 2002 DCFS was the result of the merger of the workshops DCAGRS (Descriptional Complexity of Automata, Grammars and Related Structures) and FDSR (Formal Descriptions and Software Reliability). The workshop is often collocated with international conferences in related fields, such as ICALP, DLT and CIAA.

Topics of the workshop

Typical topics include:

As such, the topics of the conference overlap with those of the International Federation for Information Processing Working Group 1.2 on descriptional complexity.

Significance

In a survey on descriptional complexity, Holzer & Kutrib (2010) state that "since more than a decade the Workshop on 'Descriptional Complexity of Formal Systems' (DCFS), [...] has contributed substantially to the development of [its] field of research." In a talk on the occasion of the 10th anniversary of the workshop, Dassow (2009) gave an overview about trends and directions in research papers presented at DCFS.

History of the workshop

Proceedings: Lecture Notes in Computer Science, vol. 9118
Proceedings: Lecture Notes in Computer Science, vol. 8614
Special issue: Theoretical Computer Science, to appear.
Proceedings: Lecture Notes in Computer Science, vol. 8031
Proceedings: Lecture Notes in Computer Science, vol. 7386
Special Issue: Journal of Automata, Languages and Combinatorics, to appear.
Proceedings: Lecture Notes in Computer Science, vol. 6808
Special issue: Theoretical Computer Science, 449, 2012
Special Issue: International Journal of Foundations of Computer Science, 23(1), 2012.
Special Issue: Journal of Automata, Languages and Combinatorics, 15(1-2), 2010.
Special Issue: Theoretical Computer Science 410(35), 2009.
Special Issue: International Journal of Foundations of Computer Science 19(4), 2008.
Special Issue: Theoretical Computer Science 387(2), 2007
Special Issue: Journal of Automata, Languages and Combinatorics 12(1/2), 2007
Special Issue: International Journal of Foundations of Computer Science 16(5), 2005
Special Issue: Theoretical Computer Science 330(2), 2005
Special Issue: Journal of Automata, Languages and Combinatorics 9(2/3), 2004

DCAGRS (predecessor of DCFS)

Special Issue: Journal of Automata, Languages and Combinatorics 7(4), 2002
Special Issue: Journal of Automata, Languages and Combinatorics 6(4), 2001
Special Issue: Journal of Automata, Languages and Combinatorics 5(3), 2000

FSDR (other predecessor of DCFS)

See also

Notes

    References

    External links

    Descriptional Complexity of Formal Systems: official website

    This article is issued from Wikipedia - version of the Monday, October 26, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.