| 2003 |
|---|
| 17 | EE | Masashi Katsura,
Yuji Kobayashi,
Friedrich Otto:
Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditions.
Theor. Comput. Sci. 1-3(301): 79-101 (2003) |
| 16 | | Masashi Katsura,
Yuji Kobayashi:
Undecidable properties of monoids with word problem solvable in linear time.
Theor. Comput. Sci. 290(3): 1301-1316 (2003) |
| 2001 |
|---|
| 15 | | Helmut Jürgensen,
Masashi Katsura,
Stavros Konstantinidis:
Maximal Solid Codes.
Journal of Automata, Languages and Combinatorics 6(1): 25-50 (2001) |
| 14 | EE | Yuji Kobayashi,
Masashi Katsura,
Kayoko Shikishima-Tsuji:
Termination and derivational complexity of confluent one-rule string-rewriting systems.
Theor. Comput. Sci. 262(1): 583-632 (2001) |
| 2000 |
|---|
| 13 | EE | Masashi Katsura,
Yuji Kobayashi,
Friedrich Otto:
Undecidability Results for Monoids with Linear-Time Decidable Word Problems.
ISAAC 2000: 278-289 |
| 1998 |
|---|
| 12 | | Friedrich Otto,
Masashi Katsura,
Yuji Kobayashi:
Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented Monoids.
J. Symb. Comput. 26(5): 621-648 (1998) |
| 1997 |
|---|
| 11 | | Friedrich Otto,
Masashi Katsura,
Yuji Kobayashi:
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems.
RTA 1997: 53-67 |
| 10 | EE | Kayoko Shikishima-Tsuji,
Masashi Katsura,
Yuji Kobayashi:
On Termination of Confluent One-Rule String-Rewriting Systems.
Inf. Process. Lett. 61(2): 91-96 (1997) |
| 9 | | Ferucio Laurentiu Tiplea,
Masashi Katsura,
Masami Ito:
Processes and Vectorial Characterizations of Parallel Communicating Grammar Systems.
Journal of Automata, Languages and Combinatorics 2(1): 47-78 (1997) |
| 1996 |
|---|
| 8 | EE | Ferucio Laurentiu Tiplea,
Masashi Katsura,
Masami Ito:
On a Normal Form of Petri Nets.
Acta Cybern. 12(3): 295-308 (1996) |
| 1993 |
|---|
| 7 | | Pál Dömösi,
Sándor Horváth,
Masami Ito,
László Kászonyi,
Masashi Katsura:
Formal Languages Consisting of Primitive Words.
FCT 1993: 194-203 |
| 6 | | Masashi Katsura,
Genjiro Tanaka:
Groups of Finite Elementary Codes.
Theor. Comput. Sci. 108(1): 119-149 (1993) |
| 5 | | Masashi Katsura,
Yuji Kobayashi:
The Shuffle Algebra and its Derivations.
Theor. Comput. Sci. 115(2): 359-369 (1993) |
| 1988 |
|---|
| 4 | | Masashi Katsura:
Automorphism Groups and Factor Automata of Strongly Connected Automata.
J. Comput. Syst. Sci. 36(1): 25-65 (1988) |
| 1987 |
|---|
| 3 | | Masashi Katsura:
On a problem of Ádám concerning procodes assigned to finite Moore automata.
Acta Cybern. 8: 143-151 (1987) |
| 2 | | Masami Ito,
Masashi Katsura,
Huei-Jan Shyr:
Regular Domains.
Elektronische Informationsverarbeitung und Kybernetik 23(2/3): 67-80 (1987) |
| 1986 |
|---|
| 1 | | Masashi Katsura:
On compexity of finite moore automata.
Acta Cybern. 7(3): 281-292 (1986) |
