Recognizability Equals Definability for Partial k-Paths

Valentine Kabanets. Recognizability Equals Definability for Partial k-Paths. In Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela, editors, Automata, Languages and Programming, 24th International Colloquium, ICALP 97, Bologna, Italy, 7-11 July 1997, Proceedings. Volume 1256 of Lecture Notes in Computer Science, pages 805-815, Springer, 1997.

Abstract

Abstract is missing.