libri scuola books Fumetti ebook dvd top ten sconti 0 Carrello


Torna Indietro
ARGOMENTO:  BOOKS > INFORMATICA > TESTI GENERALI

câmpeanu cezar (curatore); manea florin (curatore); shallit jeffrey (curatore) - descriptional complexity of formal systems

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

; ;




Disponibilità: Normalmente disponibile in 15 giorni


PREZZO
54,98 €
NICEPRICE
52,23 €
SCONTO
5%



Questo prodotto usufruisce delle SPEDIZIONI GRATIS
selezionando l'opzione Corriere Veloce in fase di ordine.


Pagabile anche con Carta della cultura giovani e del merito, 18App Bonus Cultura e Carta del Docente


Facebook Twitter Aggiungi commento


Spese Gratis

Dettagli

Genere:Libro
Lingua: Inglese
Editore:

Springer

Pubblicazione: 06/2016
Edizione: 1st ed. 2016





Trama

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. 




Sommario

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 Shu?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.










Altre Informazioni

ISBN:

9783319411132

Condizione: Nuovo
Collana: Lecture Notes in Computer Science
Dimensioni: 235 x 155 mm
Formato: Brossura
Illustration Notes:XVI, 217 p. 50 illus.
Pagine Arabe: 217
Pagine Romane: xvi


Dicono di noi