The presentation of deterministic and strongly deterministic graphs
From MaRDI portal
Publication:6561526
DOI10.12958/ADM2157MaRDI QIDQ6561526
O. S. Senchenko, M. I. Prytula
Publication date: 25 June 2024
Published in: Algebra and Discrete Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of weighted automata
- Endomorphisms of graphs. I: The monoid of strong endomorphisms
- Process algebras for Petri nets. The alphabetization of distributed systems
- Graph Theory
- Computational Principles of Mobile Robotics
- Properties of systems of defining relations for automata
- Linguistic representation of vertex-labeled graphs
- Certain congruences on free trioids
This page was built for publication: The presentation of deterministic and strongly deterministic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561526)
