Descriptional complexity of formal systems. 13th international workshop, DCFS 2011, Gießen/Limburg, Germany, July 25--27, 2011. Proceedings

DOI10.1007/978-3-642-22600-7zbMATH Open1218.68017OpenAlexW4243792334MaRDI QIDQ555653FDOQ555653

Authors:

Publication date: 25 July 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22600-7

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Grammars and rewriting systems (68Q42)

Cited In (3)

• Preface. Descriptional complexity of formal systems (DCFS 2019)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Descriptional complexity of formal systems. 13th international workshop, DCFS 2011, Gießen/Limburg, Germany, July 25--27, 2011. Proceedings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q555653)