Lower Bounds for Complementation of Omega-Automata via the Full Automata Technique

Logical Methods in Computer Science - Germany
doi 10.2168/lmcs-4(1:5)2008
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Logical Methods in Computer Science e.V.

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy