Some notes on finite state languages and events represented by finite automata using labelled graphs
Karel Čulík (1961)
Časopis pro pěstování matematiky
Similarity:
Displaying similar documents to “Conditional programmed automata”
Some notes on finite state languages and events represented by finite automata using labelled graphs
Řešení jednoduchých logických úloh pomocí vybarvování grafů
Jaroslav Šedivý (1969)
Kybernetika
Similarity:
On the set of all shortest paths of a given length in a connected graph
Ladislav Nebeský (1996)
Czechoslovak Mathematical Journal
Similarity:
On a certain numbering of the vertices of a hypergraph
Ladislav Nebeský (1983)
Czechoslovak Mathematical Journal
Similarity:
A characterization of hypergraphs generated by arborescences
Maciej M. Sysło (1979)
Kybernetika
Similarity: