STATE MACHINES IN ARTIFICIAL INTELLIGENCE

The circuits are graphs with sliding connections having circles. The concept is the
same, we can define paths, and circuits to have the maintenance of the structure of
the graph after deleting of vertices and edges.
2.6 Inverse transcription
The inverse trascription is the process to extract a string from a graph. If the graph
has a regular structure the inverse transcription can be a composed function. How
to define an inverse transcription is a problem of graph programming. Now we are
going to explain the concept. Suppose we have the graph:
We want that the output of the inverse transcription is:
– The Set Colours has the elements : red , green , blue
we can easily define a function for the inverse transcription like this:
1. Graph ITSubgraphs = FindSubgraph ( MainGraph, TranscriptionOfSet )
2. If ( ITSubgraphs == null ) Return
3. For Each ITSubgraph SET { InverseTranscriptionOfSet ( SET );
FUNCTION InverseTranscriptionOfSet ( Graph SET )
4. Cursor C = SET.FindVertex ( “Set” );
30