Complementation, Disambiguation, and Determinization of Büchi Automata Unified
From MaRDI portal
Publication:3521961
DOI10.1007/978-3-540-70575-8_59zbMath1153.68032OpenAlexW1964626357MaRDI QIDQ3521961
Publication date: 28 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_59
Related Items
Ramsey-Based Inclusion Checking for Visibly Pushdown Automata, Automata Theory and Model Checking, Multi-Valued Reasoning about Reactive Systems, Choice functions and well-orderings over the infinite binary tree, On the power of finite ambiguity in Büchi complementation, Towards a grand unification of Büchi complementation constructions, Profile trees for Büchi word automata, with application to determinization, Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata, Unnamed Item, Unnamed Item, New Optimizations and Heuristics for Determinization of Büchi Automata, Büchi Store: An Open Repository of Büchi Automata, A Decision Procedure for CTL* Based on Tableaux and Automata, Unnamed Item, State of Büchi Complementation, Unnamed Item, LTL Model Checking of Time-Inhomogeneous Markov Chains, Solving Parity Games in Practice
