S. S. Yu

According to our database1, S. S. Yu authored at least 18 papers between 1990 and 2010.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2010
The decodability and correctability of codes.
Int. J. Comput. Math., 2010

2008
Prefix-primitivity-preserving homomorphisms.
Discret. Math., 2008

2005
Dependences related to strict binary relations.
Theor. Comput. Sci., 2005

Languages and P0L schemes.
Int. J. Comput. Math., 2005

2004
Word-paired insertions of languages.
Int. J. Comput. Math., 2004

A note of ins-primitive words.
Int. J. Comput. Math., 2004

Word-paired catenations of regular languages.
Discret. Math., 2004

2003
The Disjunctivities of w-languages.
Discret. Appl. Math., 2003

2002
Word Operation Closure and Primitivity of Languages.
J. Univers. Comput. Sci., 2002

2001
Post-plus languages.
Theor. Comput. Sci., 2001

2000
Palindrome words and reverse closed languages.
Int. J. Comput. Math., 2000

Properties of Fibonacci languages.
Discret. Math., 2000

1998
A characterization of local regular languages.
Discret. Math., 1998

d-minimal Languages.
Discret. Appl. Math., 1998

1994
Monogenic e-closed languages and dipolar words.
Discret. Math., 1994

1991
Relations on free monoids, their independent sets, and codes.
Int. J. Comput. Math., 1991

1990
A characterization of intercodes.
Int. J. Comput. Math., 1990

Solid Codes.
J. Inf. Process. Cybern., 1990


  Loading...