| TÃtulo : |
Descriptional Complexity of Formal Systems : 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings |
| Tipo de documento: |
documento electrónico |
| Autores: |
Pighizzini, Giovanni, ; Câmpeanu, Cezar, |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2017 |
| Número de páginas: |
X, 311 p. 76 ilustraciones |
| ISBN/ISSN/DL: |
978-3-319-60252-3 |
| Nota general: |
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. |
| Idioma : |
Inglés (eng) |
| Palabras clave: |
Ciencias de la Computación TeorÃa de las máquinas Algoritmos IngenierÃa de software Lógica informática y fundamentos de la programación. TeorÃa de la Computación Lenguajes formales y teorÃa de los autómatas |
| Clasificación: |
40.151 |
| Resumen: |
Este libro constituye las actas de la 19.ª Conferencia Internacional sobre Complejidad Descriptiva de Sistemas Formales, DCFS 2017, celebrada en Milán, Italia, en julio de 2017. Los 20 artÃculos completos presentados junto con 4 charlas invitadas fueron cuidadosamente revisados ​​y seleccionados entre 26 presentaciones. La complejidad es un campo de la informática que se ocupa del tamaño de todo tipo de objetos que aparecen en modelos computacionales, como máquinas de Turing, autómatas finitos, gramáticas, sistemas de empalme y otros. Los temas de esta conferencia están relacionados con todos los aspectos de la complejidad descriptiva. |
| Nota de contenido: |
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. |
| Tipo de medio : |
Computadora |
| Summary : |
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 ï¬eld in Computer Science that deals with the size of all kinds of objects that occur in computational models, such as turing machines, ï¬nite automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity. |
| Enlace de acceso : |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
Descriptional Complexity of Formal Systems : 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings [documento electrónico] / Pighizzini, Giovanni, ; Câmpeanu, Cezar, . - 1 ed. . - [s.l.] : Springer, 2017 . - X, 311 p. 76 ilustraciones. ISBN : 978-3-319-60252-3 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. Idioma : Inglés ( eng)
| Palabras clave: |
Ciencias de la Computación TeorÃa de las máquinas Algoritmos IngenierÃa de software Lógica informática y fundamentos de la programación. TeorÃa de la Computación Lenguajes formales y teorÃa de los autómatas |
| Clasificación: |
40.151 |
| Resumen: |
Este libro constituye las actas de la 19.ª Conferencia Internacional sobre Complejidad Descriptiva de Sistemas Formales, DCFS 2017, celebrada en Milán, Italia, en julio de 2017. Los 20 artÃculos completos presentados junto con 4 charlas invitadas fueron cuidadosamente revisados ​​y seleccionados entre 26 presentaciones. La complejidad es un campo de la informática que se ocupa del tamaño de todo tipo de objetos que aparecen en modelos computacionales, como máquinas de Turing, autómatas finitos, gramáticas, sistemas de empalme y otros. Los temas de esta conferencia están relacionados con todos los aspectos de la complejidad descriptiva. |
| Nota de contenido: |
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. |
| Tipo de medio : |
Computadora |
| Summary : |
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 ï¬eld in Computer Science that deals with the size of all kinds of objects that occur in computational models, such as turing machines, ï¬nite automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity. |
| Enlace de acceso : |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
|  |
Crear una solicitud de compra Refinar búsqueda
