scientific article; zbMATH DE number 914394
From MaRDI portal
Publication:4889862
zbMath0906.68099MaRDI QIDQ4889862
Publication date: 7 August 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Algebraic theory of languages and automata (68Q70)
Related Items (30)
T-irreducible extension of polygonal digraphs ⋮ Algebraic interpretation of a microprogram finite-state machine with datapath of transitions ⋮ On a concrete characterization problem of universal graphic semiautomata ⋮ Vertex extensions of 4-layer graphs and hypercubes ⋮ THE MINIMAL VERTEX EXTENSIONS FOR COLORED COMPLETE GRAPHS ⋮ On concrete characterization of universal graphic automata ⋮ Acts over semigroups ⋮ Attractors and cyclic states in finite dynamic systems of complete graphs orientations ⋮ Optimal graphs with prescribed connectivities ⋮ On Definability of Universal Graphic Automata by Their Input Symbol Semigroups ⋮ Construction of All Minimal Edge Extensions of the Graph with Isomorphism Rejection ⋮ T-IRREDUCIBLE EXTENSIONS OF DIRECTED STARLIKE TREES ⋮ ON MINIMAL VERTEX 1-EXTENSIONS OF PATH ORIENTATION ⋮ CONSTRUCTING ALL NONISOMORPHIC SUPERGRAPHS WITH ISOMORPHISM REJECTION ⋮ Construction of All Nonisomorphic Minimal Vertex Extensions of the Graph by the Method of Canonical Representatives ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ About uniqueness of the minimal 1-edge extension of hypercube Q4 ⋮ Relatively elementary definability of the class of universal graphic semiautomata in the class of semigroups
This page was built for publication:
