Descriptional Complexity of Formal Systems : 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings / edited by Jeffrey Shallit, Alexander Okhotin.

1st ed. 2015.
Cham : Springer International Publishing : Imprint: Springer, 2015.
Computer Science (Springer-11645)
LNCS sublibrary. Theoretical computer science and general issues SL 1, 9118
Theoretical Computer Science and General Issues ; 9118
1 online resource (XII, 293 pages) : 48 illustrations
Logic, Symbolic and mathematical.
Computer logic.
Computer science-Mathematics.
Local subjects:
Computation by Abstract Devices. (search)
Mathematical Logic and Formal Languages. (search)
Logics and Meanings of Programs. (search)
Algorithm Analysis and Problem Complexity. (search)
Discrete Mathematics in Computer Science. (search)
System Details:
text file PDF
This book constitutes the refereed proceedings of the 17th International Conference on Descriptional Complexity of Formal Systems, DCFS 2015, held in Waterloo, ON, Canada, in June 2015. The 23 full papers presented  together with 2 invited talks were carefully reviewed and selected from 29 submissions. The subject of the workshop was descriptional complexity. Roughly speaking, this  field is concerned with the size of objects in various mathematical models of computation, such as finite automata, pushdown automata, and Turing machines. Descriptional complexity serves as a theoretical representation of physical realizations, such as the engineering complexity of computer software and hardware. It also models similar complexity phenomena in other areas of computer science, including unconventional computing and bioinformatics.
Invited Talks
Regular Functions
Unambiguity in Automata Theory
Contributed Papers
Partial Derivative Automaton for Regular Expressions with Shue
Upper Bound on Syntactic Complexity of Suffix-Free Languages
Nondeterministic Tree Width of Regular Languages
Integer Complexity: Experimental and Analytical Results II
Square on ideal, closed and free languages
A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0,2]
Compressibility of finite languages by grammars
On the Complexity and Decidability of Some Problems Involving Shue
On the Computational Complexity of Problems Related to Distinguishability Sets
Prefix-Free Subsets of Regular Languages and Descriptional Complexity
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems
On Simulation Costs of Unary Limited Automata
On some decision problems for stateless deterministic ordered restarting Automata
Quantum queries on permutations
Complement on Free and Ideal Languages
Universal Disjunctive Concatenation and Star
Quasi-Distances and Weighted Finite Automata
The State Complexity of Permutations on Finite Languages Over Binary Alphabets
Star-Complement-Star on Prefix-Free Languages
Groups whose word problem is a Petri net language
Regular realizability problems and context-free languages
Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton
Quantum State Complexity of Formal Languages.
Shallit, Jeffrey. editor., Editor,
Okhotin, Alexander, editor., Editor,
SpringerLink (Online service)
Contained In:
Springer eBooks
Other format:
Printed edition:
Printed edition:
Publisher Number:
10.1007/978-3-319-19225-3 doi
Access Restriction:
Restricted for use by site license.
Location Notes Your Loan Policy
Description Status Barcode Your Loan Policy