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 ﬁeld in Computer Science that deals with the size of all kinds of objects that occur in computational models, such as turing machines, ﬁnite automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity.

Produktinformation

Utgivningsdatum2017-06-03
Mått155 x 235 x 18 mm
Vikt493 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor311
FörlagSpringer International Publishing AG
ISBN9783319602516

Tillhör följande kategorier

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.

Mer från samma författare

Del 11376

SOFSEM 2019: Theory and Practice of Computer Science

Barbara Catania, Rastislav Královič, Jerzy Nawrocki, Giovanni Pighizzini

Häftad, 2019

729 kr

Mathematical Foundations of Computer Science 2015

Giuseppe F. Italiano, Giovanni Pighizzini, Donald T. Sannella

Häftad, 2015

719 kr

Mathematical Foundations of Computer Science 2015

Giuseppe F Italiano, Giovanni Pighizzini, Donald T. Sannella

Häftad, 2015

719 kr

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

749 kr

Del 15427

Internet of Things – ICIOT 2024

Shunli Zhang, Liang-Jie Zhang

Häftad, 2024

819 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

729 kr

Compiler Construction

Albert Cohen

Häftad, 2014

719 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

729 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

749 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

749 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

749 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 219 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

749 kr

Du kanske också är intresserad av

Del 16681

Descriptional Complexity of Formal Systems

Cezar Câmpeanu, Luca Prigioniero, Taylor J. Smith

Häftad, 2026

869 kr

Descriptional Complexity of Formal Systems

Markus Holzer, Martin Kutrib, Giovanni Pighizzini

Häftad, 2011

749 kr

Del 15759

Descriptional Complexity of Formal Systems

Andreas Malcher, Luca Prigioniero

Häftad, 2025

1 929 kr

Descriptional Complexity of Formal Systems

Jürgensen, Rogério Reis

Häftad, 2013

729 kr

Del 13439

Descriptional Complexity of Formal Systems

Yo-Sub Han, György Vaszil

Häftad, 2022

1 119 kr

Del 13918

Descriptional Complexity of Formal Systems

Henning Bordihn, Nicholas Tran, György Vaszil

Häftad, 2023

899 kr

Del 11612

Descriptional Complexity of Formal Systems

Michal Hospodár, Galina Jirásková, Stavros Konstantinidis

Häftad, 2019

749 kr

Descriptional Complexity of Formal Systems

Martin Kutrib, Nelma Moreira, Rogério Reis

Häftad, 2012

749 kr

Del 13037

Descriptional Complexity of Formal Systems

Yo-Sub Han, Sang-Ki Ko

Häftad, 2021

899 kr

Del 8614

Descriptional Complexity of Formal Systems

Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin

Häftad, 2014

729 kr

Del 10316 i serien Lecture Notes in Computer Science

Descriptional Complexity of Formal Systems

19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings

Häftad, Engelska, 2017

AvGiovanni Pighizzini,Cezar Câmpeanu

749 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

899 kr

Skickas inom 10-15 vardagar

Häftad

1 119 kr

Skickas inom 10-15 vardagar

Häftad

899 kr

Skickas inom 10-15 vardagar

Häftad

1 929 kr

Skickas inom 10-15 vardagar

Häftad

869 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum2017-06-03
Mått155 x 235 x 18 mm
Vikt493 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor311
FörlagSpringer International Publishing AG
ISBN9783319602516

Tillhör följande kategorier

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.