Author:
Ibarra Oscar H.,Ravikumar Bala
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Berman, P., A note on sweeping automata, ICALP 1979, pp. 91–97.
2. Chan, T. and O. Ibarra, On the finite-valuedness problem for sequential machines, Theoretical Computer Science, 1983, pp. 95–101.
3. Denes, J., K.H. Kim and F.W. Rouch, Automata on one symbol, Studies in Pure Mathematics 1985, pp. 127–134.
4. Ehrenfeucht, A. and P. Zeiger, Complexity measures for regular expressions, Journal of Computer and System Sciences, 12, 1976, pp. 134–146.
5. Eilenberg, S., Automata, Languages and machines, Vol. A, Academic Press, NY 1974.