Descriptional complexity of formal systems

DOI10.1016/J.TCS.2015.11.027MaRDI QIDQ896672zbMATH OpenOpenAlexFDO

Authors

Publication date 10 December 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.11.027

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Recommendations

• Preface. Descriptional complexity of formal systems (DCFS 2019)
• Special section on descriptional complexity of formal systems
• Preface
• Preface
• Preface

Cited in

(10)

• Complex systems, complexity measures, grammars and model-inferring
• Special section on descriptional complexity of formal systems
• Formal descriptions of code properties: decidability, complexity, implementation
• On the descriptional complexity of some variants of Lindenmayer systems
• Preface
• Preface
• scientific article; zbMATH DE number 2201367 (Why is no real title available?)
• On descriptive complexity of P systems
• Preface
• On the computational and descriptional complexity of multi-pattern languages

This page was built for publication: Descriptional complexity of formal systems

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