%0 Conference Proceedings
%T State Complexity of Suffix Distance
%+ Queen's University [Kingston, Canada]
%A Ng, Timothy
%A Rappaport, David
%A Salomaa, Kai
%Z Part 2: Contributed Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 19th International Conference on Descriptional Complexity of Formal Systems (DCFS)
%C Milano, Italy
%Y Giovanni Pighizzini
%Y Cezar Câmpeanu
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-10316
%P 287-298
%8 2017-07-03
%D 2017
%R 10.1007/978-3-319-60252-3_23
%Z Computer Science [cs]Conference papers
%X The neighbourhood of a regular language with respect to the prefix, suffix and subword distance is always regular and a tight bound for the state complexity of prefix distance neighbourhoods is known. We give upper bounds for the state complexity of the neighbourhood of radius k of an n state DFA (deterministic finite automaton) language with respect to the suffix distance and the subword distance, respectively. For restricted values of k and n we give a matching lower bound for the state complexity of suffix distance neighbourhoods.
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01656995/document
%2 https://inria.hal.science/hal-01656995/file/440206_1_En_23_Chapter.pdf
%L hal-01656995
%U https://inria.hal.science/hal-01656995
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-WG1-2
%~ IFIP-LNCS-10316