Advanced automata minimization
From MaRDI portal
Publication:2931784
DOI10.1145/2429069.2429079zbMath1301.68171arXiv1210.6624MaRDI QIDQ2931784
Lorenzo Clemente, Richard Mayr
Publication date: 27 November 2014
Published in: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.6624
68W05: Nonnumerical algorithms
68Q45: Formal languages and automata
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Unnamed Item, Unnamed Item, Topological Characterisation of Multi-Buffer Simulation, Coinductive Algorithms for Büchi Automata, On the power of finite ambiguity in Büchi complementation, Organising LTL monitors over distributed systems with a global clock, Parity game reductions, Multi-buffer simulations: decidability and complexity, Minimization of Visibly Pushdown Automata Using Partial Max-SAT, Forward Bisimulations for Nondeterministic Symbolic Finite Automata