KI-Beratung Beta

  • Produktbild: Descriptional Complexity of Formal Systems
  • Produktbild: Descriptional Complexity of Formal Systems
Band 9777

Descriptional Complexity of Formal Systems 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings

51,99 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

his book constitutes the refereed proceedings of the 18th International Conference on Descriptional Complexity of Formal Systems, DCFS 2016, held in Bucharest, Romania, in July 2016. The 13 full papers presented together with 4 invited talks were carefully reviewed and selected from 21 submissions.Descriptional...

Beschreibung

his book constitutes the refereed proceedings of the 18th International Conference on Descriptional Complexity of Formal Systems, DCFS 2016, held in Bucharest, Romania, in July 2016. The 13 full papers presented together with 4 invited talks were carefully reviewed and selected from 21 submissions.Descriptional Complexity is a field in Computer Science that deals with the size of all kind of objects that occur in computational models, such as Turing Machines, finte automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity. 

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

28.06.2016

Abbildungen

XVI, 217 p. 50 illus.

Herausgeber Cezar Câmpeanu + weitere

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

28.06.2016

Abbildungen

XVI, 217 p. 50 illus.

Herausgeber
Verlag Springer
Seitenzahl

217

Maße (L/B/H)

23,5/15,5/1,3 cm

Gewicht

365 g

Auflage

1st ed. 2016

Sprache

Englisch

ISBN

978-3-319-41113-2

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

  • Produktbild: Descriptional Complexity of Formal Systems
  • Produktbild: Descriptional Complexity of Formal Systems
  • Completely Reachable Automata.- Words Avoiding Patterns, Enumeration Problems and the Chomsky Hierarchy.- Heapability, interactive particle systems, partial orders: results and open problems.- Self-Verifying Finite Automata and Descriptional Complexity.- On the State Complexity of Partial Derivative Automata for Regular Expressions with Intersection.- Unrestricted State Complexity of Binary Operations on Regular Languages.- On the State Complexity of the Shuffle of Regular Languages.- MSO-definable properties of Muller context-free languages are decidable.- Contextual Array Grammars with Matrix and Regular Control.- Descriptional Complexity of Graph-controlled Insertion-deletion Systems.- Operations on Weakly Recognizing Morphisms.- Descriptional Complexity of Bounded Regular Languages.- The Complexity of Languages Resulting from the Concatenation Operation.- Minimal and Reduced Reversible Automata.