✦ LIBER ✦
Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of R-strongly connected automata
✍ Scribed by Shuhua Zhang
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 862 KB
- Volume
- 95
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.