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.
Sample Chapter(s)
Chapter 1: Solidifyable Minimal Clones of Partial Operations (215 KB)
Contents:
- Solidifyable Minimal Clone of Partial Operation (S Busaman & K Denecke)
- A Novel Cryptosystem Based on Finite Automata Without Output (P Dömösi)
- Linear Languages of Finite and Infinite Words (Z Ésik et al.)
- Extended Temporal Logics on Finite Words (Z Ésik & S Iván)
- The Number of Distinct 4-Cycles and 2-Matchings of Some Zero-Divisor Graphs (M Kanemitsu)
- On Normal Form Grammars and Their Size (A Kelemenová et al.)
- Groöbner Bases on Algebras Based on Well-Ordered Semigroups (Y Kobayashi)
- Concurrent Finite Automata and Related Language Classes (M Kudlek & G Zetzsche)
- Finitely Expandable Deep PDAs (P Leupold & A Meduna)
- The Primitivity Distance of Words (G Lischke)
- Fine Convergence of Functions and Its Effectivization (T Mori et al.)
- On a Hierarchy of Permutation Languages (B Nagy)
- Derivation Trees for Context-Sensitive Grammars (B Nagy)
- On Proper Languages and Transformations of Lexicalized Types of Automata (F Otto)
- Initial Literal Shuffles of Uniform Codes (G Tanaka & Y Kunimochi)
Readership: Theoretical computer scientists and mathematicians.