Descriptional Complexity of Formal Systems, 1st ed. 2016 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings Theoretical Computer Science and General Issues Series
Coordonnateurs : Câmpeanu Cezar, Manea Florin, Shallit Jeffrey
Includes supplementary material: sn.pub/extras
Date de parution : 06-2016
Ouvrage de 217 p.
15.5x23.5 cm
Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).
Prix indicatif 52,74 €
Ajouter au panierThèmes de Descriptional Complexity of Formal Systems :
Mots-clés :
automata theory; context free languages; formal languages; regular languages; turing machines; automata extensions; computational completeness; descriptional complexity measures; deterministic finite automaton; grammars; graph-controlled systems; information theory; insertion-deletion systems; models of computation; quantitative automata; quantum complexity theory; state complexity; syntactic complexity; theory of computation; unrestricted complexity