Abstract
Semi-flower languages are those of the form L* for some finite maximal prefix code L, or equivalently, those recognizable by a so-called semi-flower automaton, in which all the cycles have a common state q0, which happens to be the initial state and the only accepting state. We show that the syntactic complexity of these languages is exactly nn − n! + n (where n stands for the state complexity as usual) and that this bound is reachable with an alphabet of size n.
Cite
CITATION STYLE
Gelle, K., & Iván, S. (2019). The Syntactic Complexity of Semi-flower Languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11612 LNCS, pp. 147–157). Springer Verlag. https://doi.org/10.1007/978-3-030-23247-4_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
