New Results On Semilinear Sets And Variants Of Jumping Finite Automata

Author : Simon Beier
Publisher : Logos Verlag Berlin GmbH
Page : 244 pages
File Size : 45,7 Mb
Release : 2020-11-09
Category : Computers
ISBN : 9783832552107

Get Book

New Results on Semilinear Sets and Variants of Jumping Finite Automata by Simon Beier Pdf

In formal language theory, the Parikh-image describes the absolute frequencies of symbols in words of a given language. The Parikh-images of regular languages are the same as the ones of context-free languages. These kinds of sets are called semilinear. Another algebraically defined class of sets has played an important role since the early days of formal language theory: recognizable subsets of monoids are a generalization of regular languages. A set is recognizable if and only if its syntactic monoid is finite. The first part of this monograph gives new results on semilinear sets. The descriptional complexity of operations is investigated. Semirecognizable subsets of monoids are introduced. Semirecognizability demands that the projection of the subset to its syntactic monoid is finite. The semirecognizable subsets of finitely generated free commutative monoids, which form a proper subset of the semilinear sets, are studied. Connections to rational cones enable the use of geometric methods. Jumping finite automata are a model for discontinuous information processing that has attracted interest for some years. Their operational state complexity and a variant called right one-way jumping finite automata are explored in the second part. We show that a permutation closed language is accepted by this variant if and only if it is semirecognizable. Results from the first part are used to get a better insight into these devices.

Author : Michal Hospodár,Galina Jirásková,Stavros Konstantinidis
Publisher : Springer
Page : 299 pages
File Size : 49,8 Mb
Release : 2019-07-08
Category : Computers
ISBN : 9783030232474

Get Book

Descriptional Complexity of Formal Systems by Michal Hospodár,Galina Jirásková,Stavros Konstantinidis Pdf

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.

Author : Frank Drewes
Publisher : Springer Nature
Page : 276 pages
File Size : 53,7 Mb
Release : 2023
Category : Electronic books
ISBN : 9783031332647

Get Book

Developments in Language Theory by Frank Drewes Pdf

This book constitutes the refereed proceedings of the 27th International Conference on Developments in Language Theory, DLT 2023, held in Umeå, Sweden, during June 12–16, 2023. The 20 full papers included in this book were carefully reviewed and selected from 32 submissions (31 regular ones and one invited).The DLT conference series provides a forum for presenting current developments informal languages and automata. Its scope is very general and includes, among others, the following topics and areas: grammars, acceptors and transducers for words; trees and graphs; relations between formal languages and artificial neural networks; algebraic theories of automata; algorithmic, combinatorial, and algebraic properties of words and languages; variable length codes; symbolic dynamics; cellular automata; groups and semigroups generated by automata; polyominoes and multidimensional patterns; decidability questions; image manipulation and compression; efficient text algorithms; relationships to cryptography, concurrency, complexity theory, and logic; bio-inspired computing; and quantum computing.

Author : Michal Hospodár,Galina Jirásková
Publisher : Springer
Page : 249 pages
File Size : 49,5 Mb
Release : 2019-07-08
Category : Computers
ISBN : 9783030236793

Get Book

Implementation and Application of Automata by Michal Hospodár,Galina Jirásková Pdf

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

Author : Barbara Catania,Rastislav Královič,Jerzy Nawrocki,Giovanni Pighizzini
Publisher : Springer
Page : 548 pages
File Size : 43,5 Mb
Release : 2019-01-10
Category : Computers
ISBN : 9783030108014

Get Book

SOFSEM 2019: Theory and Practice of Computer Science by Barbara Catania,Rastislav Královič,Jerzy Nawrocki,Giovanni Pighizzini Pdf

This book constitutes the refereed proceedings of the 45th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2019, held in Nový Smokovec, Slovakia, in January 2019. The 34 full papers presented together with 6 invited talks were carefully reviewed and selected from 92 submissions. They presented new research results in the theory and practice of computer science in the each sub-area of SOFSEM 2019: Foundations of theoretical Computer Science, foundations of data science and engineering, and foundations of software engineering.

Author : Bruno Courcelle,Joost Engelfriet
Publisher : Cambridge University Press
Page : 743 pages
File Size : 50,9 Mb
Release : 2012-06-14
Category : Mathematics
ISBN : 9781139644006

Get Book

Graph Structure and Monadic Second-Order Logic by Bruno Courcelle,Joost Engelfriet Pdf

The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The authors not only provide a thorough description of the theory, but also detail its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory.

Author : Stavros Konstantinidis,Giovanni Pighizzini
Publisher : Springer
Page : 0 pages
File Size : 52,5 Mb
Release : 2018-07-11
Category : Computers
ISBN : 3319946307

Get Book

Descriptional Complexity of Formal Systems by Stavros Konstantinidis,Giovanni Pighizzini Pdf

This book constitutes the proceedings of the 20th International Conference on Descriptional Complexity of Formal Systems, DCFS 2018, held in Halifax, NS, Canada, in July 2018. The 19 full papers presented were carefully reviewed and selected from 24 submissions. DCFS is an annual international working conference concerning the descriptional complexity of formal systems and structures and its applications. Topics of interest are related to all aspects of descriptional complexity and much more.

Author : Richard S. Sutton,Andrew G. Barto
Publisher : MIT Press
Page : 549 pages
File Size : 47,7 Mb
Release : 2018-11-13
Category : Computers
ISBN : 9780262352703

Get Book

Reinforcement Learning, second edition by Richard S. Sutton,Andrew G. Barto Pdf

The significantly expanded and updated new edition of a widely used text on reinforcement learning, one of the most active research areas in artificial intelligence. Reinforcement learning, one of the most active research areas in artificial intelligence, is a computational approach to learning whereby an agent tries to maximize the total amount of reward it receives while interacting with a complex, uncertain environment. In Reinforcement Learning, Richard Sutton and Andrew Barto provide a clear and simple account of the field's key ideas and algorithms. This second edition has been significantly expanded and updated, presenting new topics and updating coverage of other topics. Like the first edition, this second edition focuses on core online learning algorithms, with the more mathematical material set off in shaded boxes. Part I covers as much of reinforcement learning as possible without going beyond the tabular case for which exact solutions can be found. Many algorithms presented in this part are new to the second edition, including UCB, Expected Sarsa, and Double Learning. Part II extends these ideas to function approximation, with new sections on such topics as artificial neural networks and the Fourier basis, and offers expanded treatment of off-policy learning and policy-gradient methods. Part III has new chapters on reinforcement learning's relationships to psychology and neuroscience, as well as an updated case-studies chapter including AlphaGo and AlphaGo Zero, Atari game playing, and IBM Watson's wagering strategy. The final chapter discusses the future societal impacts of reinforcement learning.

Author : Grzegorz Rozenberg
Publisher : Springer Science & Business Media
Page : 654 pages
File Size : 45,7 Mb
Release : 1997
Category : Computers
ISBN : 3540606491

Get Book

Handbook of Formal Languages by Grzegorz Rozenberg Pdf

This third volume of the Handbook of Formal Languages discusses language theory beyond linear or string models: trees, graphs, grids, pictures, computer graphics. Many chapters offer an authoritative self-contained exposition of an entire area. Special emphasis is on interconnections with logic.

Author : Dexter C. Kozen
Publisher : Springer
Page : 399 pages
File Size : 50,9 Mb
Release : 2013-11-11
Category : Computers
ISBN : 9783642857065

Get Book

Automata and Computability by Dexter C. Kozen Pdf

These are my lecture notes from CS381/481: Automata and Computability Theory, a one-semester senior-level course I have taught at Cornell Uni versity for many years. I took this course myself in thc fall of 1974 as a first-year Ph.D. student at Cornell from Juris Hartmanis and have been in love with the subject ever sin,:e. The course is required for computer science majors at Cornell. It exists in two forms: CS481, an honors version; and CS381, a somewhat gentler paced version. The syllabus is roughly the same, but CS481 go es deeper into thc subject, covers more material, and is taught at a more abstract level. Students are encouraged to start off in one or the other, then switch within the first few weeks if they find the other version more suitaLle to their level of mathematical skill. The purpose of t.hc course is twofold: to introduce computer science students to the rieh heritage of models and abstractions that have arisen over the years; and to dew!c'p the capacity to form abstractions of their own and reason in terms of them.

Author : Alonso Castillo-Ramirez,Pedro P. B. de Oliveira
Publisher : Springer
Page : 105 pages
File Size : 41,6 Mb
Release : 2019-06-19
Category : Computers
ISBN : 9783030209810

Get Book

Cellular Automata and Discrete Complex Systems by Alonso Castillo-Ramirez,Pedro P. B. de Oliveira Pdf

This volume constitutes the refereed proceedings of the 25th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2019, held in Guadalajara, Mexico, in June 2019.The 7 regular papers presented in this book were carefully reviewed and selected from a total of 10 submissions. The topics of the conference include deal with dynamical, topological, ergodic and algebraic aspects of CA and DCS, algorithmic and complexity issues, emergent properties, formal languages, symbolic dynamics, tilings, models of parallelism and distributed systems, timing schemes, synchronous versus asynchronous models, phenomenological descriptions, scientic modeling, and practical applications.

Author : Cristian S. Calude,Gheorghe Paun
Publisher : Springer Science & Business Media
Page : 376 pages
File Size : 47,5 Mb
Release : 2012-12-06
Category : Mathematics
ISBN : 9781447107514

Get Book

Finite Versus Infinite by Cristian S. Calude,Gheorghe Paun Pdf

The finite - infinite interplay is central in human thinking, from ancient philosophers and mathematicians (Zeno, Pythagoras), to modern mathe matics (Cantor, Hilbert) and computer science (Turing, Godel). Recent developments in mathematics and computer science suggest a) radically new answers to classical questions (e. g. , does infinity exist?, where does infinity come from?, how to reconcile the finiteness of the human brain with the infinity of ideas it produces?), b) new questions of debate (e. g. , what is the role played by randomness?, are computers capable of handling the infinity through unconventional media of computation?, how can one approximate efficiently the finite by the infinite and, conversely, the infinite by finite?). Distinguished authors from around the world, many of them architects of the mathematics and computer science for the new century, contribute to the volume. Papers are as varied as Professor Marcus' activity, to whom this volume is dedicated. They range from real analysis to DNA com puting, from linguistics to logic, from combinatorics on words to symbolic dynamics, from automata theory to geography, and so on, plus an incursion into the old history of conceptions about infinity and a list of philosophical "open problems". They are mainly mathematical and theoretical computer science texts, but not all of them are purely mathematical.

Author : Anonim
Publisher : Unknown
Page : 1574 pages
File Size : 50,7 Mb
Release : 2004
Category : Mathematics
ISBN : UVA:X006180726

Get Book

Mathematical Reviews by Anonim Pdf

Author : Ding-Zhu Du,Ker-I Ko
Publisher : John Wiley & Sons
Page : 405 pages
File Size : 42,5 Mb
Release : 2004-04-05
Category : Computers
ISBN : 9780471464082

Get Book

Problem Solving in Automata, Languages, and Complexity by Ding-Zhu Du,Ker-I Ko Pdf

Automata and natural language theory are topics lying at the heart of computer science. Both are linked to computational complexity and together, these disciplines help define the parameters of what constitutes a computer, the structure of programs, which problems are solvable by computers, and a range of other crucial aspects of the practice of computer science. In this important volume, two respected authors/editors in the field offer accessible, practice-oriented coverage of these issues with an emphasis on refining core problem solving skills.

Author : Marcus Kracht
Publisher : Walter de Gruyter
Page : 616 pages
File Size : 55,5 Mb
Release : 2003
Category : Language Arts & Disciplines
ISBN : 3110176203

Get Book

The Mathematics of Language by Marcus Kracht Pdf

Table of contents