State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
From MaRDI portal
Publication:2843086
DOI10.1007/978-3-642-39310-5_9zbMath1388.68168MaRDI QIDQ2843086
Yo-Sub Han, Kai Salomaa, Hae-Sung Eom
Publication date: 9 August 2013
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39310-5_9
68Q45: Formal languages and automata