State Complexity of Star and Square of Union of k Regular Languages
From MaRDI portal
Publication:3167579
DOI10.1007/978-3-642-31623-4_12zbMATH Open1304.68101OpenAlexW14029668MaRDI QIDQ3167579
Publication date: 2 November 2012
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-31623-4_12
Related Items (3)
On the State Complexity of Star of Union and Star of Intersection ⋮ State complexity of union and intersection of star on \(k\) regular languages ⋮ The Average State Complexity of the Star of a Finite Set of Words Is Linear
This page was built for publication: State Complexity of Star and Square of Union of k Regular Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167579)
