Name
Affiliation
Papers
MASAMI ITO
Department of Mathematics, Faculty of Science, Kyoto Sangyo University, Department of Mathematics, Kyoto 603-8555, Japan
66
Collaborators
Citations 
PageRank 
57
299
66.19
Referers 
Referees 
References 
437
236
194
Search Limit
100437
Title
Citations
PageRank
Year
Algebraic structures of automata30.402012
K-Restricted Duplication Closure of Languages.00.342011
Bounded hairpin completion80.592011
Bounded Hairpin Completion70.572009
Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings241.662008
On monogenic nondeterministic automata10.472008
Shortest directing words of nondeterministic directable automata00.342008
Marcus contextual languages consisting of primitive words80.692008
Blind Source Separation Coping with the Change of the Number of Sources00.342007
Generalized periodicity and primitivity for words110.862007
Corrigendum to "Generalized periodicity and primitivity for words10.382007
Closure of language classes under bounded duplication40.482006
On regular languages determined by nondeterministic directable automata00.342005
Some Results on Directable Automata90.912004
n-Insertion on Languages20.412004
On Commutative Directable Nondeterministic Automata20.552003
Some Remarks on Primitive Words and Palindromes.00.342003
Developments in Language Theory, 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers313.882003
On monotonic directable nondeterministic automata20.532003
Some Remarks on Codes Defined by Petri Nets10.782002
Multiple keyword patterns in context-free languages00.342001
Chomsky-Schu"tzenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages00.342001
Words, Semigroups, and Transductions - Festschrift in Honor of Gabriel Thierrin3612.502001
Some Petri Net Languages and Codes10.432001
A Characterization of Parikh Sets of ET0L Languages in Terms of P Systems161.752001
Group weighted finite transducers10.382001
Semigroups and Algebraic Engineering - Foreword00.342000
Shuffle and scattered deletion closure of languages201.432000
A Parsing Problem for Context-Sensitive Languages.00.342000
On Commutative Asynchronous Automata.20.432000
Decidable and Undecidable Problems of Primitive Words, Regular and Context-Free Languages60.831999
On Some Special Classes of Regular Languages40.661999
A note on the star-product00.341999
A mathematical model of adaptive behavior in quadruped locomotion.222.231998
Development of a quadrupedal robot adapting to environmental changes.00.341998
Decomposition And Parallel Learning Of Imbalanced Classification Problems By Min-Max Modular Neural Network10.511998
Decomposing and Parallel Learning of Large-Scale Pattern Recognition Problems using Min-Max Modular Neural Network00.341998
Figure-Ground Separation From Motion-Subjective Contour And Front Dynamics00.341998
Internal Observation Systems And A Theory Of Reaction-Diffusion Equation On A Graph50.941998
Diffusion-based learning theory for organizing visuo-motor coordination.20.521998
Task Decomposition Based on Class Relations: A Modular Neural Network Architecture for Pattern Classification141.491997
Processes and vectorial characterizations of parallel communicating grammar systems00.341997
Insertion and deletion closure of languages101.171997
On a Normal Form of Petri Nets00.341996
A New Pumping Property of Context-Free Language.00.341996
On Shuffle Closure of Commutative Regular Languages.20.571996
A pictorial pattern recognition based on an associative memory by use of the reaction-diffusion equation.10.481995
On cooperative manipulation of dynamic object.30.561995
Height Functions and Linear Languages00.341995
Nonlinear robust control for robot compliant manipulation on dynamic environments10.401995
  • 1
  • 2