Willkommen, schön sind Sie da!
Logo Ex Libris

Descriptional Complexity of Formal Systems

  • E-Book (pdf)
  • 217 Seiten
(0) Erste Bewertung abgeben
Bewertungen
(0)
(0)
(0)
(0)
(0)
Alle Bewertungen ansehen
his book constitutes the refereed proceedings of the 18th International Conference on Descriptional Complexity of Formal Systems,... Weiterlesen
E-Books ganz einfach mit der kostenlosen Ex Libris-Reader-App lesen. Hier erhalten Sie Ihren Download-Link.
CHF 75.90
Download steht sofort bereit
Informationen zu E-Books
E-Books eignen sich auch für mobile Geräte (sehen Sie dazu die Anleitungen).
E-Books von Ex Libris sind mit Adobe DRM kopiergeschützt: Erfahren Sie mehr.
Weitere Informationen finden Sie hier.
Bestellung & Lieferung in eine Filiale möglich

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



Inhalt

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 Shüe of Regular Languages.- MSO-de nable 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.

Produktinformationen

Titel: Descriptional Complexity of Formal Systems
Untertitel: 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings
Editor:
EAN: 9783319411149
Digitaler Kopierschutz: Wasserzeichen
Format: E-Book (pdf)
Hersteller: Springer International Publishing
Genre: IT & Internet
Anzahl Seiten: 217
Veröffentlichung: 13.07.2016
Dateigrösse: 4.7 MB

Weitere Bände aus der Buchreihe "Lecture Notes in Computer Science"