Description
Book Synopsis.- Fibonacci Pictures on a Binary Alphabet.
.- A Close Analysis of the Subset Construction.
.- k-local Graphs.
.- Word-Representable Graphs and Locality of Words.
.- Automata for Synchronised Shuffle on Backbones.
.- Two-Word Shuffle: Some Results.
.- Matrix Forbidding Grammars.
.- On the Decidability and Expressive Power of Several Theories Based on String Constraints.
.- Scattered Context Grammars with One Non-Context-Free Production and Six Nonterminals are Computationally Complete.
.- Disjunctive Complexity.
.- Two-Way Finite Automata with Translucent Input Letters.
.- Relative Densities of Formal Languages.
.- On A Measure for The Descriptional Complexity of Finite Automata with Translucent Words.
.- What is the Most Natural Generalization of the Pumping Lemmas for Regular and Context-Free Languages?.
.- Small Balanced Vertex Separators in NFA to Regular Expression Conversion.
