State Complexity of Prefix Distance of Subregular Languages
The neighbourhood of a regular language of constant radius with respect to the prefix distance is always regular. We give upper bounds and matching lower bounds for the size of the minimal deterministic finite automaton (DFA) needed for the radius k prefix distance neighbourhood of an n state DFA that recognizes, respectively, a finite, a prefix-closed and a prefix-free language. For prefix-closed languages the lower bound automata are defined over a binary alphabet. For finite and prefix-free regular languages the lower bound constructions use an alphabet that depends on the size of the DFA and it is shown that the size of the alphabet is optimal.
KeywordsState Complexity Regular Language Empty String Deterministic Finite Automaton State Complexity Bound
- 6.Gao, Y., Moreira, N., Reis, R., Yu, S.: A review on state complexity of individual operations. Faculdade de Ciencias, Universidade do Porto, Technical report DCC-2011-8. To appear in Computer Science Review. www.dcc.fc.up.pt/dcc/Pubs/TReports/TR11/dcc-2011-08.pdf
- 7.Han, Y.S., Salomaa, K., Wood, D.: State complexity of prefix-free regular languages. In: Proceedings of the 8th International Workshop on Descriptive Complexity of Formal Systems. pp. 165–176 (2006)Google Scholar
- 11.Holzer, M., Truthe, B.: On relations between some subregular language families. Proc. NCMA 2015, 109–124 (2015)Google Scholar