101 followers
Equivalence of Probabilistic mu-Calculus and p-Automata https://t.co/ScaWnOlZvs #lra #leicester
Implementation and Application of Automata
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 On the Complexity of Determinizing Monitors
-
Altmetric BadgeChapter 2 On the Semantics of Atomic Subgroups in Practical Regular Expressions
-
Altmetric BadgeChapter 3 On the Regularity and Learnability of Ordered DAG Languages
-
Altmetric BadgeChapter 4 On the Number of Active States in Deterministic and Nondeterministic Finite Automata
-
Altmetric BadgeChapter 5 Complexity of Proper Prefix-Convex Regular Languages
-
Altmetric BadgeChapter 6 Equivalence of Probabilistic $$\mu $$ -Calculus and p-Automata
-
Altmetric BadgeChapter 7 Complexity of Bifix-Free Regular Languages
-
Altmetric BadgeChapter 8 Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems
-
Altmetric BadgeChapter 9 Stamina: Stabilisation Monoids in Automata Theory
-
Altmetric BadgeChapter 10 A Simple Method for Building Bimachines from Functional Finite-State Transducers
-
Altmetric BadgeChapter 11 Alignment Distance of Regular Tree Languages
-
Altmetric BadgeChapter 12 Nondeterministic Complexity of Operations on Free and Convex Languages
-
Altmetric BadgeChapter 13 Transducing Reversibly with Finite State Machines
-
Altmetric BadgeChapter 14 From Hadamard Expressions to Weighted Rotating Automata and Back
-
Altmetric BadgeChapter 15 On the Conjecture $$\mathcal {L}_{\mathsf {DFCM}}\subsetneq \mathsf {RCM}$$
-
Altmetric BadgeChapter 16 Synchronization Problems in Automata Without Non-trivial Cycles
-
Altmetric BadgeChapter 17 Syntactic Complexity of Bifix-Free Languages