Información del autor
Autor Jirásková, Galina |
Documentos disponibles escritos por este autor (3)
Crear una solicitud de compra Refinar búsquedaDescriptional Complexity of Formal Systems / Hospodár, Michal ; Jirásková, Galina ; Konstantinidis, Stavros
TÃtulo : Descriptional Complexity of Formal Systems : 21st IFIP WG 1.02 International Conference, DCFS 2019, KoÅ¡ice, Slovakia, July 17–19, 2019, Proceedings / Tipo de documento: documento electrónico Autores: Hospodár, Michal, ; Jirásková, Galina, ; Konstantinidis, Stavros, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2019 Número de páginas: X, 299 p. 230 ilustraciones, 5 ilustraciones en color. ISBN/ISSN/DL: 978-3-030-23247-4 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 Inteligencia artificial Gestión de base de datos Computadoras Propósitos especiales Lógica informática y fundamentos de la programación. Lenguajes formales y teorÃa de los autómatas Sistemas de propósito especial y basados ​​en aplicaciones Clasificación: 40.151 Resumen: Este libro constituye las actas de la 21.ª Conferencia Internacional sobre Complejidad Descriptiva de Sistemas de Formato, DCFS 2019, celebrada en KoÅ¡ice, Eslovaquia, en julio de 2019. Los 18 artÃculos completos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 25 presentaciones. El libro también contiene 4 charlas invitadas. Se ocupan de todos los aspectos de la complejidad descriptiva y los costos de descripción de objetos en varios modelos computacionales, como máquinas de Turing, autómatas pushdown, autómatas finitos, gramáticas y otros. . Nota de contenido: A General Framework for Sequential Grammars with Control Mechanisms -- Low-Complexity Tilings of the Plane -- Union-Freeness, Deterministic Union-Freeness and Union-Complexity -- Limited Automata: Properties, Complexity and Variants -- Nondeterministic Right One-Way Jumping Finite Automata -- State Complexity of Single-Word Pattern Matching in Regular Languages -- Square, Power, Positive Closure, and Complementation on Star-Free Languages -- Descriptional Complexity of Matrix Simple Semi-Conditional Grammars -- Regulated Tree Automata -- Generalized de Bruijn Words and the State Complexity of Conjugate Sets -- The Syntactic Complexity of Semi-Flower Languages -- Limited Nondeterminism of Input-Driven Pushdown Automata Decidability and Complexity -- Computability on Quasi-Polish Spaces -- NFA-to-DFA Trade-Off for Regular Operations -- State Complexity of Simple Splicing -- Nondeterminism Growth and State Complexity -- Descriptional Complexity of Iterated Uniform Finite State Transducers.-On Classes of Regular Languages Related to Monotone WQOs -- State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages -- Pushdown Automata and Constant Height: Decidability and Bounds -- On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances -- How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory. . Tipo de medio : Computadora Summary : This book constitutes the proceedings of the 21st International Conference on Descriptional Complexity of Format Systems, DCFS 2019, held in Košice, Slovakia, in July 2019. The 18 full papers presented in this volume were carefully reviewed and selected from 25 submissions. The book also contains 4 invited talks. They deal with all aspects of descriptional complexity and costs of description of objects in various computational models, such as Turing machines, pushdown automata, finite automata, grammars, and others. . Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] Descriptional Complexity of Formal Systems : 21st IFIP WG 1.02 International Conference, DCFS 2019, KoÅ¡ice, Slovakia, July 17–19, 2019, Proceedings / [documento electrónico] / Hospodár, Michal, ; Jirásková, Galina, ; Konstantinidis, Stavros, . - 1 ed. . - [s.l.] : Springer, 2019 . - X, 299 p. 230 ilustraciones, 5 ilustraciones en color.
ISBN : 978-3-030-23247-4
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 Inteligencia artificial Gestión de base de datos Computadoras Propósitos especiales Lógica informática y fundamentos de la programación. Lenguajes formales y teorÃa de los autómatas Sistemas de propósito especial y basados ​​en aplicaciones Clasificación: 40.151 Resumen: Este libro constituye las actas de la 21.ª Conferencia Internacional sobre Complejidad Descriptiva de Sistemas de Formato, DCFS 2019, celebrada en KoÅ¡ice, Eslovaquia, en julio de 2019. Los 18 artÃculos completos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 25 presentaciones. El libro también contiene 4 charlas invitadas. Se ocupan de todos los aspectos de la complejidad descriptiva y los costos de descripción de objetos en varios modelos computacionales, como máquinas de Turing, autómatas pushdown, autómatas finitos, gramáticas y otros. . Nota de contenido: A General Framework for Sequential Grammars with Control Mechanisms -- Low-Complexity Tilings of the Plane -- Union-Freeness, Deterministic Union-Freeness and Union-Complexity -- Limited Automata: Properties, Complexity and Variants -- Nondeterministic Right One-Way Jumping Finite Automata -- State Complexity of Single-Word Pattern Matching in Regular Languages -- Square, Power, Positive Closure, and Complementation on Star-Free Languages -- Descriptional Complexity of Matrix Simple Semi-Conditional Grammars -- Regulated Tree Automata -- Generalized de Bruijn Words and the State Complexity of Conjugate Sets -- The Syntactic Complexity of Semi-Flower Languages -- Limited Nondeterminism of Input-Driven Pushdown Automata Decidability and Complexity -- Computability on Quasi-Polish Spaces -- NFA-to-DFA Trade-Off for Regular Operations -- State Complexity of Simple Splicing -- Nondeterminism Growth and State Complexity -- Descriptional Complexity of Iterated Uniform Finite State Transducers.-On Classes of Regular Languages Related to Monotone WQOs -- State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages -- Pushdown Automata and Constant Height: Decidability and Bounds -- On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances -- How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory. . Tipo de medio : Computadora Summary : This book constitutes the proceedings of the 21st International Conference on Descriptional Complexity of Format Systems, DCFS 2019, held in Košice, Slovakia, in July 2019. The 18 full papers presented in this volume were carefully reviewed and selected from 25 submissions. The book also contains 4 invited talks. They deal with all aspects of descriptional complexity and costs of description of objects in various computational models, such as Turing machines, pushdown automata, finite automata, grammars, and others. . Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
TÃtulo : Descriptional Complexity of Formal Systems : 22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings / Tipo de documento: documento electrónico Autores: Jirásková, Galina, ; Pighizzini, Giovanni, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2020 Número de páginas: X, 245 p. 327 ilustraciones, 9 ilustraciones en color. ISBN/ISSN/DL: 978-3-030-62536-8 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 Inteligencia artificial TeorÃa de las máquinas Gestión de base de datos Lógica informática y fundamentos de la programación. Lenguajes formales y teorÃa de los autómatas Clasificación: 40.151 Resumen: Este libro constituye las actas de la 22.ª Conferencia Internacional sobre Complejidad Descriptiva de Sistemas de Formato, DCFS 2020, que se suponÃa que tendrÃa lugar en Viena, Austria, en agosto de 2020, pero la conferencia fue cancelada debido a la crisis de COVID-19. Los 19 artÃculos completos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 31 presentaciones. Se ocupan de todos los aspectos de la complejidad descriptiva y los costos de descripción de objetos en varios modelos computacionales, como máquinas de Turing, autómatas pushdown, autómatas finitos, gramáticas y otros. Nota de contenido: Mutually Accepting Capacitated Automata -- Bad pictures: some structural properties related to overlaps -- Regular Expression Length via Arithmetic Formula Complexity -- Crisp-determinization of Weighted Tree Automata over Additively Locally Finite and Past-finite Monotonic Strong Bimonoids is Decidable -- On the Power of Generalized Forbidding Insertion-Deletion Systems -- State Complexity Bounds for the Commutative Closure of Group Languages -- Multiple Concatenation and State Complexity (Extended Abstract) -- Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata -- Longer shortest strings in two-way finite automata -- Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion -- Descriptional Complexity of Winning Sets of Regular Languages -- State complexity of GF(2)-inverse and GF(2)-star on binary languages -- Complexity of Two-dimensional Rank-reducing Grammars -- Palindromic Length of Words with Many Periodic Palindromes -- Operational Complexity of Straight Line Programs for Regular Languages -- Classifying ω-Regular Aperiodic k-Partitions -- Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata -- On the Generative Power of Quasiperiods -- Insertion-Deletion Systems With Substitutions II. Tipo de medio : Computadora Summary : This book constitutes the proceedings of the 22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020, which was supposed to take place in Vienna, Austria, in August 2020, but the conference was canceled due to the COVID-19 crisis. The 19 full papers presented in this volume were carefully reviewed and selected from 31 submissions. They deal with all aspects of descriptional complexity and costs of description of objects in various computational models, such as Turing machines, pushdown automata, finite automata, grammars, and others. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] Descriptional Complexity of Formal Systems : 22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings / [documento electrónico] / Jirásková, Galina, ; Pighizzini, Giovanni, . - 1 ed. . - [s.l.] : Springer, 2020 . - X, 245 p. 327 ilustraciones, 9 ilustraciones en color.
ISBN : 978-3-030-62536-8
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 Inteligencia artificial TeorÃa de las máquinas Gestión de base de datos Lógica informática y fundamentos de la programación. Lenguajes formales y teorÃa de los autómatas Clasificación: 40.151 Resumen: Este libro constituye las actas de la 22.ª Conferencia Internacional sobre Complejidad Descriptiva de Sistemas de Formato, DCFS 2020, que se suponÃa que tendrÃa lugar en Viena, Austria, en agosto de 2020, pero la conferencia fue cancelada debido a la crisis de COVID-19. Los 19 artÃculos completos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 31 presentaciones. Se ocupan de todos los aspectos de la complejidad descriptiva y los costos de descripción de objetos en varios modelos computacionales, como máquinas de Turing, autómatas pushdown, autómatas finitos, gramáticas y otros. Nota de contenido: Mutually Accepting Capacitated Automata -- Bad pictures: some structural properties related to overlaps -- Regular Expression Length via Arithmetic Formula Complexity -- Crisp-determinization of Weighted Tree Automata over Additively Locally Finite and Past-finite Monotonic Strong Bimonoids is Decidable -- On the Power of Generalized Forbidding Insertion-Deletion Systems -- State Complexity Bounds for the Commutative Closure of Group Languages -- Multiple Concatenation and State Complexity (Extended Abstract) -- Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata -- Longer shortest strings in two-way finite automata -- Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion -- Descriptional Complexity of Winning Sets of Regular Languages -- State complexity of GF(2)-inverse and GF(2)-star on binary languages -- Complexity of Two-dimensional Rank-reducing Grammars -- Palindromic Length of Words with Many Periodic Palindromes -- Operational Complexity of Straight Line Programs for Regular Languages -- Classifying ω-Regular Aperiodic k-Partitions -- Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata -- On the Generative Power of Quasiperiods -- Insertion-Deletion Systems With Substitutions II. Tipo de medio : Computadora Summary : This book constitutes the proceedings of the 22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020, which was supposed to take place in Vienna, Austria, in August 2020, but the conference was canceled due to the COVID-19 crisis. The 19 full papers presented in this volume were carefully reviewed and selected from 31 submissions. They deal with all aspects of descriptional complexity and costs of description of objects in various computational models, such as Turing machines, pushdown automata, finite automata, grammars, and others. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
TÃtulo : Implementation and Application of Automata : 24th International Conference, CIAA 2019, KoÅ¡ice, Slovakia, July 22–25, 2019, Proceedings / Tipo de documento: documento electrónico Autores: Hospodár, Michal, ; Jirásková, Galina, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2019 Número de páginas: XVI, 249 p. 440 ilustraciones, 25 ilustraciones en color. ISBN/ISSN/DL: 978-3-030-23679-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: Red informática IngenierÃa de software IngenierÃa Informática y Redes Inteligencia artificial IngenierÃa Informática Informática Lógica informática y fundamentos de la programación. Clasificación: 40.151 Resumen: Este libro constituye las actas de la 24.ª Conferencia Internacional sobre Implementación y Aplicación de Autómatas, CIAA 2019, celebrada en Kosice, Eslovaquia, en julio de 2019. Los 17 artÃculos regulares presentados junto con 2 artÃculos invitados en este libro fueron cuidadosamente revisados ​​y seleccionados entre 29 presentaciones iniciales. Los temas de los artÃculos incluyen la complejidad de los lenguajes y las operaciones del lenguaje, expresiones regulares, lenguajes de imágenes, autómatas de salto, autómatas bidimensionales y controlados por entradas, lenguajes de árboles y transductores de árboles, arquitectura de sistemas de oritatami, problema de deducción de intrusos, códigos de ceniza sensibles al contexto, relaciones racionales y algoritmos para manipular diagramas de decisión binaria de secuencia. Nota de contenido: Static Garbage Collection -- Graph-Walking Automata: From Whence They Come, and Whither They Are Bound -- Enumerated Automata Implementation of String Dictionaries -- New Approaches for Context Sensitive Flash Codes -- Dolev-Yao Theory with Associative Blindpair Operators: An Automata-Theoretic Approach -- Semi-Linear Lattices and Right One-Way Jumping Finite Automata -- Z-Automata for Compact and Direct Representation of Unranked Tree Languages -- A Benchmark Production Tool for Regular Expressions -- New Algorithms for Manipulating Sequence BDDs -- A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs -- Composition Closure of Linear Weighted Extended Top-Down Tree Transducers -- A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata -- Descriptional Complexity of Power and Positive Closure on Convex Languages -- Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations -- Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels -- Input-Driven Multi-Counter Automata -- Two-Dimensional Pattern Matching against Basic Picture Languages -- Decision Problems for Restricted Variants of Two-Dimensional Automata -- Streaming Ranked-Tree-to-String Transducers. . Tipo de medio : Computadora Summary : This book constitutes the proceedings of the 24th International Conference on Implementation and Application of Automata, CIAA 2019, held in Kosice, Slovakia, in July 2019. The 17 regular papers presented together with 2 invited papers in this book were carefully reviewed and selected from 29 initial submissions. The topics of the papers include complexity of languages and language operations, regular expressions, picture languages, jumping automata, input driven and two-dimensional automata, tree languages and tree transducers, architecture of oritatami systems, intruder deduction problem, context sensitive ash codes, rational relations, and algorithms for manipulating sequence binary decision diagrams. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] Implementation and Application of Automata : 24th International Conference, CIAA 2019, KoÅ¡ice, Slovakia, July 22–25, 2019, Proceedings / [documento electrónico] / Hospodár, Michal, ; Jirásková, Galina, . - 1 ed. . - [s.l.] : Springer, 2019 . - XVI, 249 p. 440 ilustraciones, 25 ilustraciones en color.
ISBN : 978-3-030-23679-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: Red informática IngenierÃa de software IngenierÃa Informática y Redes Inteligencia artificial IngenierÃa Informática Informática Lógica informática y fundamentos de la programación. Clasificación: 40.151 Resumen: Este libro constituye las actas de la 24.ª Conferencia Internacional sobre Implementación y Aplicación de Autómatas, CIAA 2019, celebrada en Kosice, Eslovaquia, en julio de 2019. Los 17 artÃculos regulares presentados junto con 2 artÃculos invitados en este libro fueron cuidadosamente revisados ​​y seleccionados entre 29 presentaciones iniciales. Los temas de los artÃculos incluyen la complejidad de los lenguajes y las operaciones del lenguaje, expresiones regulares, lenguajes de imágenes, autómatas de salto, autómatas bidimensionales y controlados por entradas, lenguajes de árboles y transductores de árboles, arquitectura de sistemas de oritatami, problema de deducción de intrusos, códigos de ceniza sensibles al contexto, relaciones racionales y algoritmos para manipular diagramas de decisión binaria de secuencia. Nota de contenido: Static Garbage Collection -- Graph-Walking Automata: From Whence They Come, and Whither They Are Bound -- Enumerated Automata Implementation of String Dictionaries -- New Approaches for Context Sensitive Flash Codes -- Dolev-Yao Theory with Associative Blindpair Operators: An Automata-Theoretic Approach -- Semi-Linear Lattices and Right One-Way Jumping Finite Automata -- Z-Automata for Compact and Direct Representation of Unranked Tree Languages -- A Benchmark Production Tool for Regular Expressions -- New Algorithms for Manipulating Sequence BDDs -- A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs -- Composition Closure of Linear Weighted Extended Top-Down Tree Transducers -- A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata -- Descriptional Complexity of Power and Positive Closure on Convex Languages -- Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations -- Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels -- Input-Driven Multi-Counter Automata -- Two-Dimensional Pattern Matching against Basic Picture Languages -- Decision Problems for Restricted Variants of Two-Dimensional Automata -- Streaming Ranked-Tree-to-String Transducers. . Tipo de medio : Computadora Summary : This book constitutes the proceedings of the 24th International Conference on Implementation and Application of Automata, CIAA 2019, held in Kosice, Slovakia, in July 2019. The 17 regular papers presented together with 2 invited papers in this book were carefully reviewed and selected from 29 initial submissions. The topics of the papers include complexity of languages and language operations, regular expressions, picture languages, jumping automata, input driven and two-dimensional automata, tree languages and tree transducers, architecture of oritatami systems, intruder deduction problem, context sensitive ash codes, rational relations, and algorithms for manipulating sequence binary decision diagrams. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
