Tight Bounds for Complementing Parity Automata
From MaRDI portal
Publication:2922043
DOI10.1007/978-3-662-44522-8_42zbMath1425.68230arXiv1406.1090OpenAlexW261557608MaRDI QIDQ2922043
Publication date: 14 October 2014
Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.1090
This page was built for publication: Tight Bounds for Complementing Parity Automata