Aperiodicity, Star-freeness, and First-order Logic Definability of Structured Context-Free Languages
Preprint in arXiv (June 2020)
The most recent citing publication is shown below. View this citation on Dimensions.
Algebraic Informatics
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 On Generalizations of Weighted Finite Automata and Graphics Applications
-
Altmetric BadgeChapter 2 Sturmian and Episturmian Words
-
Altmetric BadgeChapter 3 From Tree-Based Generators to Delegation Networks
-
Altmetric BadgeChapter 4 Bifinite Chu Spaces
-
Altmetric BadgeChapter 5 Tiling Recognizable Two-Dimensional Languages
-
Altmetric BadgeChapter 6 Algebraic Methods in Quantum Informatics
-
Altmetric BadgeChapter 7 Recognizable vs. Regular Picture Languages
-
Altmetric BadgeChapter 8 From Algebraic Graph Transformation to Adhesive HLR Categories and Systems
-
Altmetric BadgeChapter 9 Deterministic Two-Dimensional Languages over One-Letter Alphabet
-
Altmetric BadgeChapter 10 Recognizable Picture Languages and Polyominoes
-
Altmetric BadgeChapter 11 An Algebra for Tree-Based Music Generation
-
Altmetric BadgeChapter 12 Aperiodicity in Tree Automata
-
Altmetric BadgeChapter 13 The Syntactic Complexity of Eulerian Graphs
-
Altmetric BadgeChapter 14 Learning Deterministically Recognizable Tree Series — Revisited
-
Altmetric BadgeChapter 15 The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
-
Altmetric BadgeChapter 16 Verifying Security Protocols for Sensor Networks Using Algebraic Specification Techniques
-
Altmetric BadgeChapter 17 Nonassociativity à la Kleene
-
Altmetric BadgeChapter 18 Restarting Tree Automata and Linear Context-Free Tree Languages