State Complexity of Chop Operations on Unary and Finite Languages
From MaRDI portal
Publication:3167580
DOI10.1007/978-3-642-31623-4_13zbMath1304.68105OpenAlexW26627830MaRDI QIDQ3167580
Sebastian Jakobi, Markus Holzer
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_13
Related Items (3)
Functional Specification of Hardware via Temporal Logic ⋮ Conjugate word blending: formal model and experimental implementation by XPCR ⋮ State Complexity of Overlap Assembly
This page was built for publication: State Complexity of Chop Operations on Unary and Finite Languages
