Opening book details…
About this Computer Science article
ON THE COMPLEXITY OF RECOGNIZABLE ω-TREE SETS AND NERODE THEOREM by SAOUDI, A.; MULLER, D.E.; SCHUPP, P.E. is a Computer Science article available to read on EtoBox.
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- SAOUDI, A.; MULLER, D.E.; SCHUPP, P.E.
- Publisher
- World Scientific Publishing Company; World Scientific ; World Scientific Publishing Co; World Scientific Pub Co Pte Lt (ISSN 0129-0541)
- Published
- 1990
- Language
- EN
- Field
- Computer Science (Physical Sciences)