scientific article; zbMATH DE number 914394
From MaRDI portal
Publication:4889862
zbMATH Open0906.68099MaRDI QIDQ4889862FDOQ4889862
Authors: A. M. Bogomolov, V. N. Saliĭ 
Publication date: 7 August 1996
Title of this publication is not available (Why is that?)
Recommendations
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Algebraic theory of languages and automata (68Q70)
Cited In (33)
- Title not available (Why is that?)
- On definability of universal graphic automata by their input symbol semigroups
- Relatively elementary definability of the class of universal graphic semiautomata in the class of semigroups
- T-irreducible extensions of directed starlike trees
- Construction of all nonisomorphic minimal vertex extensions of the graph by the method of canonical representatives
- Construction of all minimal edge extensions of the graph with isomorphism rejection
- Vertex extensions of 4-layer graphs and hypercubes
- About uniqueness of the minimal 1-edge extension of hypercube Q4
- T-irreducible extension of polygonal digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The minimal vertex extensions for colored complete graphs
- Congruence relations of paths: some combinatorial properties
- Algebraic interpretation of a microprogram finite-state machine with datapath of transitions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Acts over semigroups
- Title not available (Why is that?)
- Attractors and cyclic states in finite dynamic systems of complete graphs orientations
- On a concrete characterization problem of universal graphic semiautomata
- On concrete characterization of universal graphic automata
- Title not available (Why is that?)
- ON MINIMAL VERTEX 1-EXTENSIONS OF PATH ORIENTATION
- Title not available (Why is that?)
- Title not available (Why is that?)
- Skeleton automata
- Characterization of graphs with a given number of additional edges in a minimal 1-vertex extension
- Constructing all nonisomorphic supergraphs with isomorphism rejection
- On congruences of paths
- Optimal graphs with prescribed connectivities
- Frame of an automaton
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)
