Descriptional Complexity of Formal Systems

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

AvJeffrey Shallit,Alexander Okhotin

Häftad, Engelska, 2015

Del 9118 i serien Lecture Notes in Computer Science

534 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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. Descriptional complexity serves as a theoretical representation of physical realizations, such as the engineering complexity of computer software and hardware.

Produktinformation

Utgivningsdatum:2015-05-28
Mått:155 x 235 x 17 mm
Vikt:470 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:293
Förlag:Springer International Publishing AG
ISBN:9783319192246

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Diskret matematik inom Naturvetenskap och teknik

Innehållsförteckning

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.