Stability and Complexity of Minimising Probabilistic Automata

DOI10.1007/978-3-662-43951-7_23zbMath1409.68160arXiv1404.6673OpenAlexW2158914086MaRDI QIDQ5167844

Björn Wachter, Stefan Kiefer

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (4)

Minimisation of Multiplicity Tree Automata ⋮ Singular value automata and approximate minimization ⋮ Equivalence checking of quantum finite-state machines ⋮ Trace Refinement in Labelled Markov Decision Processes

This page was built for publication: Stability and Complexity of Minimising Probabilistic Automata