On the Average Complexity of Brzozowski’s Algorithm for Deterministic Automata with a Small Number of Final States
From MaRDI portal
Publication:2921972
DOI10.1007/978-3-319-09698-8_3zbMath1425.68193OpenAlexW160566843MaRDI QIDQ2921972
Publication date: 14 October 2014
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-01772856/file/dlt14.pdf
Related Items (1)
This page was built for publication: On the Average Complexity of Brzozowski’s Algorithm for Deterministic Automata with a Small Number of Final States