"Polynomial-Time Algorithms for Testing Strong Isomorphism and Computing ..."

Shuhua Zhang (1992)

> Home

Details and statistics

DOI: 10.1016/0304-3975(92)90268-K

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/Zhang92a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Zhang92a
Shuhua Zhang:
Polynomial-Time Algorithms for Testing Strong Isomorphism and Computing the Automorphism Group of R-Strongly Connected Automata. Theor. Comput. Sci. 95(2): 263-277 (1992)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.