Descriptional Complexity of Formal Systems

17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings

Jeffrey Shallit, Alexander Okhotin (Herausgeber)

Buch | Softcover

XII, 293 Seiten

2015 | 2015
Springer International Publishing (Verlag)
978-3-319-19224-6 (ISBN)

Artikel merken

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.

Erscheint lt. Verlag	28.5.2015
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XII, 293 p. 48 illus.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Themenwelt	Informatik ► Software Entwicklung ► User Interfaces (HCI)
	Informatik ► Theorie / Studium ► Algorithmen
	Mathematik / Informatik ► Mathematik
Schlagworte	context-free languages • Decision problem • descriptional complexity • Distance measures • DNA properties • Error-correcting codes • Finite Automata • Finite Languages • Formal Languages • Integer complexity • Measures of nondeterminism • Nondeterministic finite automat • Ordered rewriting • Permutation automaton • Petri net language • Quantum Computation • Quantum state complexity • regular languages • State Complexity • Trajectories • transducers • Turing Machines • undecidability • Weighted finite automata
ISBN-10	3-319-19224-8 / 3319192248
ISBN-13	978-3-319-19224-6 / 9783319192246
Zustand	Neuware