scientific article; zbMATH DE number 914394
From MaRDI portal
Publication:4889862
Recommendations
Cited in
(40)- Relatively elementary definability of the class of universal graphic semiautomata in the class of semigroups
- On concrete characterization of universal graphic automata
- Acts over semigroups
- Optimal graphs with prescribed connectivities
- T-irreducible extension of polygonal digraphs
- Algebraic interpretation of a microprogram finite-state machine with datapath of transitions
- scientific article; zbMATH DE number 50357 (Why is no real title available?)
- scientific article; zbMATH DE number 3503140 (Why is no real title available?)
- scientific article; zbMATH DE number 3503141 (Why is no real title available?)
- 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 definability of universal graphic automata by their input symbol semigroups
- Construction of all minimal edge extensions of the graph with isomorphism rejection
- Frame of an automaton
- scientific article; zbMATH DE number 7301718 (Why is no real title available?)
- scientific article; zbMATH DE number 7301740 (Why is no real title available?)
- scientific article; zbMATH DE number 7301789 (Why is no real title available?)
- Skeleton automata
- scientific article; zbMATH DE number 7310069 (Why is no real title available?)
- scientific article; zbMATH DE number 7310071 (Why is no real title available?)
- scientific article; zbMATH DE number 7310088 (Why is no real title available?)
- scientific article; zbMATH DE number 7310132 (Why is no real title available?)
- On congruences of paths
- Characterization of graphs with a given number of additional edges in a minimal 1-vertex extension
- Congruence relations of paths: some combinatorial properties
- scientific article; zbMATH DE number 7310226 (Why is no real title available?)
- 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
- About uniqueness of the minimal 1-edge extension of hypercube Q4
- Attractors and cyclic states in finite dynamic systems of complete graphs orientations
- One family of optimal graphs with prescribed connectivities
- The finite dynamic system of all possible orientations of a given graph with all accessible states and with inaccesible states
- Schemes for constructing minimal vertex 1-extensions of complete bicolored graphs
- On the structure of tournaments consisting of only kings
- Classification of trees whose maximal subtrees are all isomorphic
- Application of finite dynamic systems for information security
- On the minimum number of vertices and edges in a graph with prescribed connectivities
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4889862)