Automata, Formal Languages and Algebraic Systems

This volume consists of papers selected from the presentations at the workshop and includes mainly recent developments in the fields of formal languages, automata theory and algebraic systems related to the theoretical computer science and informatics. It covers the areas such as automata and grammars, languages and codes, combinatorics on words, cryptosystems, logics and trees, Grobner bases, minimal clones, zero-divisor graphs, fine convergence of functions, and others.

Table of Contents

Chapter 1 Solidifyable Minimal Clone of Partial Operation
Chapter 2 A Novel Cryptosystem Based on Finite Automata Without Output
Chapter 3 Linear Languages of Finite and Infinite Words
Chapter 4 Extended Temporal Logics on Finite Words
Chapter 5 The Number of Distinct 4-Cycles and 2-Matchings of Some Zero-Divisor Graphs
Chapter 6 On Normal Form Grammars and Their Size
Chapter 7 Grobner Bases on Algebras Based on Well-Ordered Semigroups
Chapter 8 Concurrent Finite Automata and Related Language Classes
Chapter 9 Finitely Expandable Deep PDAs
Chapter 10 The Primitivity Distance of Words
Chapter 11 Fine Convergence of Functions and Its Effectivization
Chapter 12 On a Hierarchy of Permutation Languages
Chapter 13 Derivation Trees for Context-Sensitive Grammars
Chapter 14 On Proper Languages and Transformations of Lexicalized Types of Automata
Chapter 15 Initial Literal Shuffles of Uniform Codes