Descriptional Complexity of Formal Systems 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings /

• Corporate Author: SpringerLink (Online service)
• Other Authors: Shallit, Jeffrey (Editor), Okhotin, Alexander (Editor)
• Format: Electronic eBook
• Language: English
• Published: Cham : Springer International Publishing : Imprint: Springer, 2015.
• Series: Lecture Notes in Computer Science, 9118
• Subjects: Computer science.; Computers.; Algorithms.; Computer logic.; Mathematical logic.; Computer science > Mathematics.; Computer Science.; Computation by Abstract Devices.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.

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 submissio...

Table of Contents:

• 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.