Optimal Lower Bounds on Regular Expression Size Using Communication Complexity

From MaRDI portal
Publication:5458365

DOI10.1007/978-3-540-78499-9_20zbMath1139.68033OpenAlexW2112175063MaRDI QIDQ5458365

Jan Johannsen, Hermann Gruber

Publication date: 11 April 2008

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78499-9_20




Related Items (11)



Cites Work


This page was built for publication: Optimal Lower Bounds on Regular Expression Size Using Communication Complexity