default search action
Masashi Katsura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
- [j16]Masashi Katsura, Yuji Kobayashi:
Undecidable properties of monoids with word problem solvable in linear time. Theor. Comput. Sci. 290(3): 1301-1316 (2003) - [j15]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. 301(1-3): 79-101 (2003) - [c6]Pál Dömösi, Sándor Horváth, Masami Ito, Masashi Katsura:
Some Remarks on Primitive Words and Palindromes. DCFS 2003: 245-254 - 2001
- [j14]Helmut Jürgensen, Masashi Katsura, Stavros Konstantinidis:
Maximal Solid Codes. J. Autom. Lang. Comb. 6(1): 25-50 (2001) - [j13]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
- [c5]Masashi Katsura, Yuji Kobayashi, Friedrich Otto:
Undecidability Results for Monoids with Linear-Time Decidable Word Problems. ISAAC 2000: 278-289
1990 – 1999
- 1998
- [j12]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
- [j11]Kayoko Shikishima-Tsuji, Masashi Katsura, Yuji Kobayashi:
On Termination of Confluent One-Rule String-Rewriting Systems. Inf. Process. Lett. 61(2): 91-96 (1997) - [j10]Ferucio Laurentiu Tiplea, Masashi Katsura, Masami Ito:
Processes and Vectorial Characterizations of Parallel Communicating Grammar Systems. J. Autom. Lang. Comb. 2(1): 47-73 (1997) - [c4]Friedrich Otto, Masashi Katsura, Yuji Kobayashi:
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems. RTA 1997: 53-67 - 1996
- [j9]Ferucio Laurentiu Tiplea, Masashi Katsura, Masami Ito:
On a Normal Form of Petri Nets. Acta Cybern. 12(3): 295-308 (1996) - [c3]Pál Dömösi, Masami Ito, Masashi Katsura, Chrystopher L. Nehaniv:
A New Pumping Property of Context-Free Language. DMTCS 1996: 187-193 - [c2]Balázs Imreh, Masami Ito, Masashi Katsura:
On Shuffle Closure of Commutative Regular Languages. DMTCS 1996: 276-288 - 1994
- [p1]Masami Ito, Masashi Katsura:
On Transitive Cofinal Automata. Mathematical Aspects of Natural and Formal Languages 1994: 173-199 - 1993
- [j8]Masashi Katsura, Genjiro Tanaka:
Groups of Finite Elementary Codes. Theor. Comput. Sci. 108(1): 119-149 (1993) - [j7]Masashi Katsura, Yuji Kobayashi:
The Shuffle Algebra and its Derivations. Theor. Comput. Sci. 115(2): 359-369 (1993) - [c1]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 - 1991
- [j6]Masami Ito, Masashi Katsura:
Context-free languages consisting of non-primitive words. Int. J. Comput. Math. 40(3-4): 157-167 (1991)
1980 – 1989
- 1988
- [j5]Masashi Katsura:
Automorphism Groups and Factor Automata of Strongly Connected Automata. J. Comput. Syst. Sci. 36(1): 25-65 (1988) - 1987
- [j4]Masashi Katsura:
On a problem of Ádám concerning precodes assigned to finite Moore automata. Acta Cybern. 8(2): 143-151 (1987) - [j3]Masami Ito, Masashi Katsura, Huei-Jan Shyr:
Regular Domains. J. Inf. Process. Cybern. 23(2/3): 67-80 (1987) - [j2]Masashi Katsura:
Isomorphisms of group-matrix type automata. Syst. Comput. Jpn. 18(9): 10-18 (1987) - 1986
- [j1]Masashi Katsura:
On complexity of finite moore automata. Acta Cybern. 7(3): 281-292 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: