| 2009 |
|---|
| 52 | EE | Masami Ito,
Peter Leupold,
Victor Mitrana:
Bounded Hairpin Completion.
LATA 2009: 434-445 |
| 2008 |
|---|
| 51 | | Masami Ito,
Masafumi Toyama:
Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings
Springer 2008 |
| 50 | EE | Masami Ito,
Lila Kari,
Zachary Kincaid,
Shinnosuke Seki:
Duplication in DNA Sequences.
Developments in Language Theory 2008: 419-430 |
| 49 | EE | Pál Dömösi,
Masami Ito,
Solomon Marcus:
Marcus contextual languages consisting of primitive words.
Discrete Mathematics 308(21): 4877-4881 (2008) |
| 48 | EE | Masami Ito,
Kayoko Shikishima-Tsuji:
Shortest directing words of nondeterministic directable automata.
Discrete Mathematics 308(21): 4900-4905 (2008) |
| 2007 |
|---|
| 47 | EE | Masami Ito,
Gerhard Lischke:
Generalized periodicity and primitivity for words.
Math. Log. Q. 53(1): 91-106 (2007) |
| 46 | EE | Masami Ito,
Gerhard Lischke:
Corrigendum to "Generalized periodicity and primitivity for words".
Math. Log. Q. 53(6): 642-643 (2007) |
| 2006 |
|---|
| 45 | EE | Masami Ito,
Peter Leupold,
Kayoko Shikishima-Tsuji:
Closure of Language Classes Under Bounded Duplication.
Developments in Language Theory 2006: 238-247 |
| 2005 |
|---|
| 44 | EE | Balázs Imreh,
Masami Ito:
On regular languages determined by nondeterministic directable automata.
Acta Cybern. 17(1): (2005) |
| 2004 |
|---|
| 43 | EE | Masami Ito,
Ryo Sugiura:
n-Insertion on Languages.
Aspects of Molecular Computing 2004: 213-218 |
| 42 | EE | Masami Ito,
Kayoko Shikishima-Tsuji:
Some Results on Directable Automata.
Theory Is Forever 2004: 125-133 |
| 41 | EE | Masami Ito:
Foreword.
Theor. Comput. Sci. 324(1): 1- (2004) |
| 2003 |
|---|
| 40 | | Masami Ito,
Masafumi Toyama:
Developments in Language Theory, 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers
Springer 2003 |
| 39 | | Balázs Imreh,
Masami Ito,
Magnus Steinby:
On Commutative Directable Nondeterministic Automata.
Grammars and Automata for String Processing 2003: 141-150 |
| 38 | EE | Zoltán Ésik,
Masami Ito:
Temporal Logic with Cyclic Counting and the Degree of Aperiodicity of Finite Automata.
Acta Cybern. 16(1): 1-28 (2003) |
| 37 | EE | Balázs Imreh,
Csanád Imreh,
Masami Ito:
On directable nondeterministic trapped automata.
Acta Cybern. 16(1): 37-45 (2003) |
| 36 | | Balázs Imreh,
Csanád Imreh,
Masami Ito:
On Monotonic Directable Nondeterministic Automata.
Journal of Automata, Languages and Combinatorics 8(3): 539-547 (2003) |
| 2002 |
|---|
| 35 | EE | Masami Ito:
Shuffle Decomposition of Regular Languages.
J. UCS 8(2): 257-259 (2002) |
| 34 | EE | Masami Ito,
Jürgen Dassow,
Ralf Stiebe:
Some Remarks on Codes Defined by Petri Nets.
J. UCS 8(2): 260-269 (2002) |
| 2001 |
|---|
| 33 | | Masami Ito,
Gheorghe Paun,
Sheng Yu:
Words, Semigroups, and Transductions - Festschrift in Honor of Gabriel Thierrin
World Scientific 2001 |
| 32 | EE | Masami Ito,
Yoshiyuki Kunimoch:
Some Petri Net Languages and Codes.
Developments in Language Theory 2001: 69-80 |
| 31 | | Masami Ito,
Carlos Martín-Vide,
Gheorghe Paun:
A Characterization of Parikh Sets of ET0L Languages in Terms of P Systems.
Words, Semigroups, and Transductions 2001: 239-253 |
| 30 | EE | Masami Ito,
Carlos Martín-Vide,
Victor Mitrana:
Group weighted finite transducers.
Acta Inf. 38(2): 117-129 (2001) |
| 29 | EE | Masami Ito,
Carlos Martín-Vide,
Victor Mitrana:
Chomsky-Schu"tzenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages.
Electr. Notes Theor. Comput. Sci. 53: (2001) |
| 2000 |
|---|
| 28 | EE | Balázs Imreh,
Masami Ito,
A. Pukler:
On commutative asynchronous nondeterministic automata.
Acta Cybern. 14(4): 607-617 (2000) |
| 27 | EE | Masami Ito,
Chrystopher L. Nehaniv:
Semigroups and Algebraic Engineering - Foreword.
Theor. Comput. Sci. 245(1): 1 (2000) |
| 26 | EE | Masami Ito,
Lila Kari,
Gabriel Thierrin:
Shuffle and scattered deletion closure of languages.
Theor. Comput. Sci. 245(1): 115-133 (2000) |
| 1999 |
|---|
| 25 | | Balázs Imreh,
Masami Ito:
On Some Special Classes of Regular Languages.
Jewels are Forever 1999: 25-34 |
| 24 | EE | Balázs Imreh,
Masami Ito:
A Note on the Star-Product.
Acta Cybern. 14(1): 99-104 (1999) |
| 23 | EE | Bao-Liang Lu,
Masami Ito:
Task decomposition and module combination based on class relations: a modular neural network for pattern classification.
IEEE Transactions on Neural Networks 10(5): 1244-1256 (1999) |
| 22 | EE | Sándor Horváth,
Masami Ito:
Decidable and Undecidable Problems of Primitive Words, Regular and Context-Free Languages.
J. UCS 5(9): 532-541 (1999) |
| 1998 |
|---|
| 21 | | Bao-Liang Lu,
Masami Ito:
Decomposition and Parallel Learning of Imbalanced Classification Problems by Min-Max Modular Neural Network.
ICONIP 1998: 199-202 |
| 20 | | Eizo Ueyama,
Hideo Yuasa,
Shigeyuki Hosoe,
Masami Ito:
Figure-Ground Separation from Motion-Subjective Contour and Front Dynamics.
ICONIP 1998: 311-314 |
| 19 | | Bao-Liang Lu,
Masami Ito:
Decomposing and Parallel Learning of Large-Scale Pattern Recognition Problems using Min-Max Modular Neural Network.
NC 1998: 703-709 |
| 1997 |
|---|
| 18 | | Bao-Liang Lu,
Masami Ito:
Task Decomposition Based on Class Relations: A Modular Neural Network Architecture for Pattern Classification.
IWANN 1997: 330-339 |
| 17 | | 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) |
| 16 | EE | Masami Ito,
Lila Kari,
Gabriel Thierrin:
Insertion and Deletion Closure of Languages.
Theor. Comput. Sci. 183(1): 3-19 (1997) |
| 1996 |
|---|
| 15 | EE | Ferucio Laurentiu Tiplea,
Masashi Katsura,
Masami Ito:
On a Normal Form of Petri Nets.
Acta Cybern. 12(3): 295-308 (1996) |
| 1995 |
|---|
| 14 | | Masami Ito:
Height Functions and Linear Languages.
Developments in Language Theory 1995: 98-101 |
| 1994 |
|---|
| 13 | | Masami Ito,
Gabriel Thierrin:
Congruences, Infix and Cohesive Prefix Codes.
Theor. Comput. Sci. 136(2): 471-485 (1994) |
| 1993 |
|---|
| 12 | | 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 |
| 11 | | Masami Ito:
Dense and Disjunctive Properties of Languages.
FCT 1993: 31-49 |
| 1992 |
|---|
| 10 | | Masami Ito,
Helmut Jürgensen,
Huei-Jan Shyr,
Gabriel Thierrin:
Languages Whose n-Element Subsets Are Codes.
Theor. Comput. Sci. 96(2): 325-344 (1992) |
| 1991 |
|---|
| 9 | | Masami Ito,
Helmut Jürgensen,
Huei-Jan Shyr,
Gabriel Thierrin:
Outfix and Infix Codes and Related Classes of Languages.
J. Comput. Syst. Sci. 43(3): 484-508 (1991) |
| 1990 |
|---|
| 8 | | Masami Ito,
Huei-Jan Shyr:
p-Languages and p-Representations.
Elektronische Informationsverarbeitung und Kybernetik 26(4): 213-228 (1990) |
| 1989 |
|---|
| 7 | EE | Masami Ito,
Helmut Jürgensen,
Huei-Jan Shyr,
Gabriel Thierrin:
Anti-commutative languages and n-codes.
Discrete Applied Mathematics 24(1-3): 187-196 (1989) |
| 6 | | Masami Ito,
Huei-Jan Shyr,
Gabriel Thierrin:
Disjunctive Languages and Compatible Orders.
ITA 23(2): 149-163 (1989) |
| 5 | EE | Yoshinori Suganuma,
Masami Ito:
Learning control and knowledge representation.
Journal of Intelligent and Robotic Systems 2(2-3): 337-358 (1989) |
| 1987 |
|---|
| 4 | | Masami Ito,
Masashi Katsura,
Huei-Jan Shyr:
Regular Domains.
Elektronische Informationsverarbeitung und Kybernetik 23(2/3): 67-80 (1987) |
| 1982 |
|---|
| 3 | | Masami Ito:
Some Classes of Automata as Partially Ordered Sets.
Mathematical Systems Theory 15(4): 357-370 (1982) |
| 1979 |
|---|
| 2 | | Masami Ito:
Input sets of strongly connected automata.
FCT 1979: 187-192 |
| 1978 |
|---|
| 1 | | Masami Ito:
A Representation of Strongly Connected Automata and its Applications.
J. Comput. Syst. Sci. 17(1): 65-80 (1978) |
