Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism

DOI10.1109/T-C.1975.224148zbMath0318.94044OpenAlexW2142350206MaRDI QIDQ4081158

Chaochih Yang

Publication date: 1975

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/t-c.1975.224148

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Information storage and retrieval of data (68P20) Categories of machines, automata (18B20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Algorithms for finding directed graph isomorphisms by finite automata

This page was built for publication: Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism