scientific article; zbMATH DE number 7561726

DOI10.4230/LIPIcs.MFCS.2019.82MaRDI QIDQ5092446

Cas Widdershoven, Stefan Kiefer

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1906.10093

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmsMarkov chainsautomatamatrix semigroups

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Image-binary automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix semigroups with constant spectral radius
• Generalized matrix inversion is not harder than matrix multiplication
• Automata, logics, and infinite games. A guide to current research
• Powers of tensors and fast matrix multiplication
• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• The generalised inverse
• The complexity of probabilistic verification
• Triangular Factorization and Inversion by Fast Matrix Multiplication
• Markov Chains and Unambiguous Büchi Automata
• Accuracy and Stability of Numerical Algorithms
• Computer Aided Verification
• Depth-First Search and Linear Graph Algorithms
• LATIN 2004: Theoretical Informatics

This page was built for publication: