New Results On Semilinear Sets And Variants Of Jumping Finite Automata
Download New Results On Semilinear Sets And Variants Of Jumping Finite Automata PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get New Results On Semilinear Sets And Variants Of Jumping Finite Automata book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
New Results on Semilinear Sets and Variants of Jumping Finite Automata
Author: Simon Beier
language: en
Publisher: Logos Verlag Berlin GmbH
Release Date: 2020-11-09
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.
Descriptional Complexity of Formal Systems
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.
Developments in Language Theory
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.