Complexity of Bifix-Free Regular Languages

Robert Ferens, Marek Szykula. Complexity of Bifix-Free Regular Languages. In Arnaud Carayol, Cyril Nicaud, editors, Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Marne-la-Vallée, France, June 27-30, 2017, Proceedings. Volume 10329 of Lecture Notes in Computer Science, pages 76-88, Springer, 2017. [doi]

Abstract

Abstract is missing.