Lower bounds for unambiguous automata via communication complexity

DOI10.4230/LIPICS.ICALP.2022.126MaRDI QIDQ6560928FDOQ6560928

Authors: Mika Göös, Stefan Kiefer 

Publication date: 24 June 2024

zbMATH Keywords

communication complexityunambiguous automata

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

This page was built for publication: Lower bounds for unambiguous automata via communication complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560928)