Descriptional Complexity of Formal Systems : 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings / / edited by Giovanni Pighizzini, Cezar Câmpeanu
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
Descriptional Complexity of Formal Systems : 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings / / edited by Giovanni Pighizzini, Cezar Câmpeanu
|
| Pubblicazione: | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Edizione: | 1st ed. 2017. |
| Descrizione fisica: | 1 online resource (X, 311 p. 76 illus.) |
| Disciplina: | 005.1015113 |
| Soggetto topico: | Computer science |
| Machine theory | |
| Algorithms | |
| Software engineering | |
| Computer Science Logic and Foundations of Programming | |
| Theory of Computation | |
| Formal Languages and Automata Theory | |
| Software Engineering | |
| Persona (resp. second.): | PighizziniGiovanni |
| CâmpeanuCezar | |
| Nota di contenuto: | 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. |
| Sommario/riassunto: | 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 field in Computer Science that deals with the size of all kinds of objects that occur in computational models, such as turing machines, finite automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity. |
| Titolo autorizzato: | Descriptional Complexity of Formal Systems |
| ISBN: | 3-319-60252-7 |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 9910483540803321 |
| Lo trovi qui: | Univ. Federico II |
| Opac: | Controlla la disponibilità qui |
Serie:
Theoretical Computer Science and General Issues, . 2512-2029 ; ; 10316