Masashi Katsura - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2003

Some Remarks on Primitive Words and PalindromesPál Dömösi, Sándor Horváth, Masami Ito, Masashi Katsura. dcfs 2003: 245-254

Undecidable properties of monoids with word problem solvable in linear timeMasashi Katsura, Yuji Kobayashi. TCS, 290(3):1301-1316, 2003.

Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditionsMasashi Katsura, Yuji Kobayashi, Friedrich Otto. TCS, 1-3(301):79-101, 2003. [doi]

2001

Maximal Solid CodesHelmut Jürgensen, Masashi Katsura, Stavros Konstantinidis. jalc, 6(1):25-50, 2001.

Termination and derivational complexity of confluent one-rule string-rewriting systemsYuji Kobayashi, Masashi Katsura, Kayoko Shikishima-Tsuji. TCS, 262(1):583-632, 2001. [doi]

2000

Undecidability Results for Monoids with Linear-Time Decidable Word ProblemsMasashi Katsura, Yuji Kobayashi, Friedrich Otto. isaac 2000: 278-289 [doi]

1998

Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented MonoidsFriedrich Otto, Masashi Katsura, Yuji Kobayashi. JSC, 26(5):621-648, 1998.

1997

Cross-Sections for Finitely Presented Monoids with Decidable Word ProblemsFriedrich Otto, Masashi Katsura, Yuji Kobayashi. RTA 1997: 53-67

On Termination of Confluent One-Rule String-Rewriting SystemsKayoko Shikishima-Tsuji, Masashi Katsura, Yuji Kobayashi. ipl, 61(2):91-96, 1997. [doi]

Processes and Vectorial Characterizations of Parallel Communicating Grammar SystemsFerucio Laurentiu Tiplea, Masashi Katsura, Masami Ito. jalc, 2(1):47-78, 1997.

1996

A New Pumping Property of Context-Free LanguagePál Dömösi, Masami Ito, Masashi Katsura, Chrystopher L. Nehaniv. dmtcs 1996: 187-193

On Shuffle Closure of Commutative Regular LanguagesBalázs Imreh, Masami Ito, Masashi Katsura. dmtcs 1996: 276-288

On a Normal Form of Petri NetsFerucio Laurentiu Tiplea, Masashi Katsura, Masami Ito. actaC, 12(3):295-308, 1996. [doi]

1994

On Transitive Cofinal AutomataMasami Ito, Masashi Katsura. In Gheorghe Paun, editor, Mathematical Aspects of Natural and Formal Languages. Volume 43 of World scientific series in computer science, pages 173-199, World Scientific, 1994. [doi]

1993

Formal Languages Consisting of Primitive WordsPál Dömösi, Sándor Horváth, Masami Ito, László Kászonyi, Masashi Katsura. fct 1993: 194-203

Groups of Finite Elementary CodesMasashi Katsura, Genjiro Tanaka. TCS, 108(1):119-149, 1993.

The Shuffle Algebra and its DerivationsMasashi Katsura, Yuji Kobayashi. TCS, 115(2):359-369, 1993.

1988

Automorphism Groups and Factor Automata of Strongly Connected AutomataMasashi Katsura. jcss, 36(1):25-65, 1988.

1987

Regular DomainsMasami Ito, Masashi Katsura, Huei-Jan Shyr. eik, 23(2/3):67-80, 1987.

On a problem of Ádám concerning procodes assigned to finite Moore automataMasashi Katsura. actaC, 8:143-151, 1987.

Isomorphisms of group-matrix type automataMasashi Katsura. scjapan, 18(9):10-18, 1987. [doi]

1986

On compexity of finite moore automataMasashi Katsura. actaC, 7(3):281-292, 1986.

Sign in or sign up to see more results.

runs on WebDSL