# Partially Injective Automata

This program works with input-letters as partial permutations of states. For example b = ( 1 4 ) < 3 5 > means that the edges from 1 to 4, 4 to 1, and 3 to 5 are labelled with b but no edge labelled with b goes to 3 or comes from 5. Furthermore we always assume implicitly the presence of the invese edge for example b- from 5 to 3.
 Example-inputs: ```a = ( 1 2 3 ) b = ( 1 2 ) a = ( 1 2 ) b = ( 1 2 3 ) c = ( 1 2 4 ) d = ( 1 2 5 ) a = < 5 1 2 6 > b = ( 1 2 3 ) c = ( 1 2 4 ) < 6 > a = ( 1 2 3 ) ( 4 5 6 ) b = ( 1 2 4 ) ( 3 5 7 ) a = ( 1 2 3 4 5 6 7 ) b = ( 1 2 4 ) ( 3 6 5 ) a = < 1 2 3 > b = < 5 3 4 > a = ( 1 2 3 ) ( 6 7 8 ) b = ( 5 3 4 6 ) a = < 1 2 3 > ( 4 ) ( 5 ) b = ( 1 ) ( 2 ) < 3 4 5 > a = ( 1 2 3 ) ( 4 ) ( 5 ) b = ( 1 ) ( 2 ) < 3 4 5 > a = ( 1 2 3 ) ( 4 ) ( 5 ) b = ( 1 ) ( 2 ) < 6 3 4 5 > a = ( 1 2 3 6 ) ( 4 ) ( 5 ) b = ( 1 ) ( 2 ) < 3 4 5 > < 6 > a = ( 1 2 3 6 ) ( 4 ) ( 5 ) < 7 > b = ( 1 ) ( 2 ) ( 3 4 5 7 ) < 6 > a = < 1 2 > b = < 1 3 2 > a = < 1 2 3 > b = < 3 2 4 1 > a = < 1 2 > < 3 4 > b = < 1 3 > < 2 5 > a = < 1 2 > < 3 4 > < 5 > b = < 1 3 > < 2 5 > < 4 > ``` Ihr Browser kann leider kein Java!! ``` a = < 4 3 > < 5 6 1 2 > b = < 2 3 > < 5 4 > < 6 1 > a = ( 4 3 7 8 ) ( 5 6 1 2 ) b = ( 2 3 ) ( 5 4 ) ( 6 1 ) ( 7 8 ) a = < 1 2 3 > < 4 5 > < 6 7 > b = < 1 4 > < 3 7 > a = < 1 2 3 4 5 > < 6 > < 7 > b = < 1 6 7 > < 2 > < 3 > < 4 > < 5 > c = < 5 7 > < 1 > < 2 > < 3 > < 4 > < 6 > a = < 1 2 3 4 5 > < 6 > < 7 > < 8 > b = < 1 6 7 > < 2 > < 3 > < 4 > < 5 > < 8 > c = < 5 8 7 > < 1 > < 2 > < 3 6 > < 4 > a = < 1 2 3 4 5 > < 6 > < 7 > b = < 1 6 7 > < 2 > < 3 > < 4 > < 5 > c = < 5 7 > < 1 > < 2 > < 3 6 > < 4 > a = ( 1 4 ) < 2 > < 3 > b = < 1 2 3 > < 4 > a = < 1 2 3 > < 4 5 > < 6 > b = < 1 4 6 > < 2 5 > < 3 > a = < 1 2 3 > < 4 5 > < 6 > b = < 3 1 4 6 > < 2 5 > a = < 1 2 3 > < 4 5 > < 6 > b = < 3 1 4 6 2 5 > a = < 1 2 3 4 > < 5 6 > < 7 > < 8 > b = < 1 5 7 8 > < 2 6 > < 3 > < 4 > a = < 8 1 2 3 4 > < 5 6 > < 7 > b = < 1 5 7 8 > < 2 6 > < 3 > < 4 > a = < 8 1 2 3 4 > < 5 6 > < 7 > b = < 3 1 5 7 8 > < 2 6 > < 4 > a = < 1 2 3 4 5 > < 6 > < 7 > < 8 > < 9 > b = < 1 > < 2 > < 6 7 3 8 9 > < 4 > < 5 > a = < 1 2 3 4 5 > < 6 > < 7 > < 8 > < 9 > < 10 > < 11 > b = < 1 > < 2 > < 6 7 3 8 9 > < 4 > < 5 > < 10 > < 11 > c = < 11 3 10 > < 1 > < 2 > < 4 > < 5 > < 6 > < 7 > < 8 > < 9 > a = < 1 2 3 4 5 > < 6 > < 7 > < 8 > < 9 > b = < 1 6 7 8 9 > < 2 > < 3 > < 4 > < 5 > ```

Last modified: 20-June-00 by Klaus Reinhardt