This book constitutes the proceedings of the 19th International Conference on Descriptional Complexity of Formal Systems, DCFS 2017, held in Milano, Italy, in July 2017. The 20 full papers presented together with 4 invited talks were carefully reviewed and selected from 26 submissions.Descriptional Complexity is a field in Computer Science that deals with the size of all kinds of objects that occur in computational models, such as turing machines, finite automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity.
Les mer
This book constitutes the proceedings of the 19th International Conference on Descriptional Complexity of Formal Systems, DCFS 2017, held in Milano, Italy, in July 2017.
Sensing as a Complexity Measure.- Avoiding Overlaps in Pictures.- Descriptional Complexity and Operations - Two non-Classical Cases.- Applications of Transducers in Independent Languages, Word Distances, Codes.- On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages.- On the Average Complexity of Strong Star Normal Form.- Most Complex Non-Returning Regular Languages.- Uncountable realtime probabilistic classes.- A Parametrized Analysis of Algorithms on Hierarchical Graphs.- Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity.- Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors.- Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete.- Self-attraction removal from oritatami systems.- One-Time Nondeterministic Computations.- Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages.- Branching Measures and Nearly Acyclic NFAs.- Square on Deterministic, Alternating, and Boolean Finite Automata.- A Pumping Lemma for Ordered Restarting Automata.- Concise Representations of Reversible Automata.- State Complexity of Unary SV-XNFA with Different Acceptance Conditions.- Reset Complexity of Ideal Languages Over a Binary Alphabet.- 2-state 2-symbol Turing machines with periodic support produce regular sets.- State Complexity of Suffix Distance.- The quotient operation on input-driven pushdown automata.
Les mer
Includes supplementary material: sn.pub/extras
GPSR Compliance The European Union's (EU) General Product Safety Regulation (GPSR) is a set of rules that requires consumer products to be safe and our obligations to ensure this. If you have any concerns about our products you can contact us on ProductSafety@springernature.com. In case Publisher is established outside the EU, the EU authorized representative is: Springer Nature Customer Service Center GmbH Europaplatz 3 69115 Heidelberg, Germany ProductSafety@springernature.com
Les mer

Produktdetaljer

ISBN
9783319602516
Publisert
2017-06-03
Utgiver
Vendor
Springer International Publishing AG
Høyde
235 mm
Bredde
155 mm
Aldersnivå
Research, P, 06
Språk
Product language
Engelsk
Format
Product format
Heftet