EUDML | A note on complexity of algorithmic nets without cycles

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “A note on complexity of algorithmic nets without cycles”

Combinatorial problems in the theory of complexity of algorithmic nets without cycles for simple computers

Karel Čulík (1971)

Aplikace matematiky

Similarity:

Syntactical definitions of program and flow diagram

Karel Čulík (1973)

Aplikace matematiky

Similarity:

Generalization of well-translation of formal languages

Jiří Kopřiva (1966)

Kybernetika

Similarity: