Algebraic structures of automata | 3 | 0.40 | 2012 |
K-Restricted Duplication Closure of Languages. | 0 | 0.34 | 2011 |
Bounded hairpin completion | 8 | 0.59 | 2011 |
Bounded Hairpin Completion | 7 | 0.57 | 2009 |
Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings | 24 | 1.66 | 2008 |
On monogenic nondeterministic automata | 1 | 0.47 | 2008 |
Shortest directing words of nondeterministic directable automata | 0 | 0.34 | 2008 |
Marcus contextual languages consisting of primitive words | 8 | 0.69 | 2008 |
Blind Source Separation Coping with the Change of the Number of Sources | 0 | 0.34 | 2007 |
Generalized periodicity and primitivity for words | 11 | 0.86 | 2007 |
Corrigendum to "Generalized periodicity and primitivity for words | 1 | 0.38 | 2007 |
Closure of language classes under bounded duplication | 4 | 0.48 | 2006 |
On regular languages determined by nondeterministic directable automata | 0 | 0.34 | 2005 |
Some Results on Directable Automata | 9 | 0.91 | 2004 |
n-Insertion on Languages | 2 | 0.41 | 2004 |
On Commutative Directable Nondeterministic Automata | 2 | 0.55 | 2003 |
Some Remarks on Primitive Words and Palindromes. | 0 | 0.34 | 2003 |
Developments in Language Theory, 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers | 31 | 3.88 | 2003 |
On monotonic directable nondeterministic automata | 2 | 0.53 | 2003 |
Some Remarks on Codes Defined by Petri Nets | 1 | 0.78 | 2002 |
Multiple keyword patterns in context-free languages | 0 | 0.34 | 2001 |
Chomsky-Schu"tzenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages | 0 | 0.34 | 2001 |
Words, Semigroups, and Transductions - Festschrift in Honor of Gabriel Thierrin | 36 | 12.50 | 2001 |
Some Petri Net Languages and Codes | 1 | 0.43 | 2001 |
A Characterization of Parikh Sets of ET0L Languages in Terms of P Systems | 16 | 1.75 | 2001 |
Group weighted finite transducers | 1 | 0.38 | 2001 |
Semigroups and Algebraic Engineering - Foreword | 0 | 0.34 | 2000 |
Shuffle and scattered deletion closure of languages | 20 | 1.43 | 2000 |
A Parsing Problem for Context-Sensitive Languages. | 0 | 0.34 | 2000 |
On Commutative Asynchronous Automata. | 2 | 0.43 | 2000 |
Decidable and Undecidable Problems of Primitive Words, Regular and Context-Free Languages | 6 | 0.83 | 1999 |
On Some Special Classes of Regular Languages | 4 | 0.66 | 1999 |
A note on the star-product | 0 | 0.34 | 1999 |
A mathematical model of adaptive behavior in quadruped locomotion. | 22 | 2.23 | 1998 |
Development of a quadrupedal robot adapting to environmental changes. | 0 | 0.34 | 1998 |
Decomposition And Parallel Learning Of Imbalanced Classification Problems By Min-Max Modular Neural Network | 1 | 0.51 | 1998 |
Decomposing and Parallel Learning of Large-Scale Pattern Recognition Problems using Min-Max Modular Neural Network | 0 | 0.34 | 1998 |
Figure-Ground Separation From Motion-Subjective Contour And Front Dynamics | 0 | 0.34 | 1998 |
Internal Observation Systems And A Theory Of Reaction-Diffusion Equation On A Graph | 5 | 0.94 | 1998 |
Diffusion-based learning theory for organizing visuo-motor coordination. | 2 | 0.52 | 1998 |
Task Decomposition Based on Class Relations: A Modular Neural Network Architecture for Pattern Classification | 14 | 1.49 | 1997 |
Processes and vectorial characterizations of parallel communicating grammar systems | 0 | 0.34 | 1997 |
Insertion and deletion closure of languages | 10 | 1.17 | 1997 |
On a Normal Form of Petri Nets | 0 | 0.34 | 1996 |
A New Pumping Property of Context-Free Language. | 0 | 0.34 | 1996 |
On Shuffle Closure of Commutative Regular Languages. | 2 | 0.57 | 1996 |
A pictorial pattern recognition based on an associative memory by use of the reaction-diffusion equation. | 1 | 0.48 | 1995 |
On cooperative manipulation of dynamic object. | 3 | 0.56 | 1995 |
Height Functions and Linear Languages | 0 | 0.34 | 1995 |
Nonlinear robust control for robot compliant manipulation on dynamic environments | 1 | 0.40 | 1995 |