Decomposition of languages into disjunctive outfix codes

  • Masashi Katsura
  • H. J. Shyr
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 1320)


Disjoint Union Regular Language Prefix Code Dense Language Disjunctive Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Lallement, G, Semigroups and combinatorial applications, Wiley, New York, 1979.zbMATHGoogle Scholar
  2. [2]
    Shyr, H. J., Free monoids and languages, Lecture Notes, Soochow University, Taipei, Taiwan, 1979.Google Scholar
  3. [3]
    Shyr, H. J., Ordered catenation and regular free disjunctive languages, Information and Control 46 (1980), 257–269.MathSciNetCrossRefzbMATHGoogle Scholar
  4. [4]
    Guo, Y. Q., Shyr, H. J. and Thierrin, G., E-convex infix codes, Order 3 (1986), 55–59.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag 1988

Authors and Affiliations

  • Masashi Katsura
  • H. J. Shyr

There are no affiliations available

Personalised recommendations