In this chapter the fundamental searching algorithms for connected,especially for finite connected,R- and C-graphs are discussed. They are mainly given by programs written in Pidgin Programming Language (PPL). The algorithms are shown to be correct, the types of automata able to implement them are characterized, and the corresponding time complexities are estimated.
Unable to display preview. Download preview PDF.