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.
@inproceedings{Kabanets97,
title = {Recognizability Equals Definability for Partial k-Paths},
author = {Valentine Kabanets},
year = {1997},
researchr = {https://researchr.org/publication/Kabanets97},
cites = {0},
citedby = {0},
pages = {805-815},
booktitle = {Automata, Languages and Programming, 24th International Colloquium, ICALP 97, Bologna, Italy, 7-11 July 1997, Proceedings},
editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti-Spaccamela},
volume = {1256},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-63165-8},
}