scientific article; zbMATH DE number 7566053
From MaRDI portal
Andrzej S. Murawski, Stefan Kiefer, David Purser, Dmitry Chistikov
Publication date: 2 August 2022
Full work available at URL: https://arxiv.org/abs/2007.07694
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The isomorphism relation between tree-automatic structures
- Unary finite automata vs. arithmetic progressions
- The influence of the marked reduced graph of a nonnegative matrix on the Jordan form and on related properties: a survey
- Finite automata and unary languages
- On path equivalence of nondeterministic finite automata
- The complexity of the characteristic and the minimal polynomial.
- Comparator automata in quantitative verification
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- What's decidable about weighted automata?
- Positive root isolation for poly-powers by exclusion and differentiation
- COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY
- Quantitative languages
- Deciding the Value 1 Problem for Probabilistic Leaktight Automata
- Generalized Bisimulation Metrics
- On the definition of a family of automata
- Cosmological lower bound on the circuit complexity of a small problem in logic
- Hyper-minimizing minimized deterministic finite state automata
- FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME
- Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
- The complexity of promise problems with applications to public-key cryptography
- The Growth of Powers of a Nonnegative Matrix
- A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- An effective version of Stallings' theorem in the case of context-free groups
- On the total variation distance of labelled Markov chains
- O-Minimal Invariants for Discrete-Time Dynamical Systems
- On Computing the Total Variation Distance of Hidden Markov Models.
- Probabilistic Automata of Bounded Ambiguity
- Markov Chains
- Positivity Problems for Low-Order Linear Recurrence Sequences
- Unambiguity in Automata Theory
- Bounded Algol-Like Languages
- On Context-Free Languages
- Asymmetric Distances for Approximate Differential Privacy
- Quantitative Languages Defined by Functional Automata
- Theory of Cryptography
- Algorithms in real algebraic geometry
