@inproceedings{b918920cdba1499e81eee666426363e7,
title = "Algorithms solving path systems",
abstract = "Al gorithms recognizing solvable path systems are presented and their time complexity is investigated. Among them there is an algorithm with a constant expected behaviour.",
author = "Chlebus, {Bogdan S.}",
note = "Publisher Copyright: {\textcopyright} 1985, Springer-Verlag.; 5th International Conference on Fundamentals of Computation Theory, FCT 1985 ; Conference date: 09-09-1985 Through 13-09-1985",
year = "1985",
doi = "10.1007/BFb0028793",
language = "English (US)",
isbn = "9783540156895",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "70--79",
editor = "Lothar Budach",
booktitle = "Fundamentals of Computation Theory - FCT 1985",
}