ON THE COMPLEXITY OF RECOGNIZABLE ω-TREE SETS AND NERODE THEOREM
From MaRDI portal
Publication:3348430
DOI10.1142/S0129054190000035zbMath0726.68056MaRDI QIDQ3348430
David E. Muller, Paul E. Schupp, Ahmed Saoudi
Publication date: 1990
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054190000035
68Q45: Formal languages and automata