Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9118)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: DCFS 2015.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (24 papers)
-
Contributed Papers
Other volumes
-
Descriptional Complexity of Formal Systems
Keywords
- DNA properties
- Decision problem
- Descriptional complexity
- Distance measures
- Finite automata
- Finite languages
- Formal languages
- Integer complexity
- Measures of nondeterminism
- Nondeterministic finite automat
- Ordered rewriting
- Permutation automaton
- Petri net language
- Quantum state complexity
- Regular languages
- State complexity
- Trajectories
- Transducers
- Undecidability
- Weighted finite automata
About this book
Editors and Affiliations
Bibliographic Information
Book Title: Descriptional Complexity of Formal Systems
Book Subtitle: 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings
Editors: Jeffrey Shallit, Alexander Okhotin
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-19225-3
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2015
Softcover ISBN: 978-3-319-19224-6Published: 28 May 2015
eBook ISBN: 978-3-319-19225-3Published: 15 June 2015
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XII, 293
Number of Illustrations: 48 b/w illustrations
Topics: Computation by Abstract Devices, Mathematical Logic and Formal Languages, Logics and Meanings of Programs, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science