Arikawa, S., Haraguchi, M., Inoue, H., Kawasaki, Y., Miyahara, T., Miyano, S., Oshima, K., Sakai, H., Shinohara, T., Shiraishi, S., Takeda, M., Takeya, S., Yamamoto, A., Yuasa, H. The text database management system SIGMA: an improvement of the main engine. Proceedings of Berliner Informatik-Tage. 72-81, 1989.
Miyano, S. The lexicographically first maximal subgraph problems - P-completeness and NC algorithms. Mathematical Systems Theory. 22(1):47-73, 1989.
Miyano, S. A parallelizable lexicographically first edge-induced subgraph problem. Information Processing Letters. 27(2):75-78, 1988.
Miyano, S. Indexing alternating finite automata and binary tree like circuits. Bulletin of Informatics and Cybernetics. 23(1-2):79-88, 1988.
Miyano, S. Parallel complexity and P-complete problems. Proceedings of International Conference on Fifth Generation Computer Systems 1988. 532-541, 1988.
Hayashi, T., Miyano, S. Finite tree automata on infinite trees. Bulletin of Informatics and Cybernetics. 21(3-4):71-82, 1985.
Miyano, S. Remarks on two-way automata with weak-counters. Information Processing Letters. 18(2):105-107, 1984.
Miyano, S., Hayashi, T. Alternating finite automata on -words.Theoretical Computer Science. 32(3):321-330, 1984.
Miyano, S. Remarks on multihead pushdown automata and multihead stack automata. Journal of Computer and System Sciences. 27(1):116-124, 1983.
Miyano, S. Two-way deterministic multi-weak-counter machines. Theoretical Computer Science. 21(1):27-32, 1982.
Miyano, S. A hierarchy theorem for multihead stack-counter automata. Acta Informatica. 17(1):63-67, 1982.
Miyano, S., Haraguchi, M. Recovery of incomplete tables under functional dependencies. Bulletin of Informatics and Cybernetics. 20(1-2):25-41, 1982.
Miyano, S. One-way weak-stack-counter automata. Journal of Computer and System Sciences. 20(1):59-76, 1980.
