Codes and maximal monoids

Authors:
Sujin Shin
Affiliations:
Department of Mathematical Sciences, Korea Advanced Institute of Science and Technology, Daejeon, 305-701, Republic of Korea
Venue:
Theoretical Computer Science
Year:
2010

Coded systems

Theoretical Computer Science
Codes and local constraints

Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
A note on renewal systems

Theoretical Computer Science - Special issue on discrete mathematics and applications to computer science
An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
Symbolic dynamics and finite automata

Handbook of formal languages, vol. 2
Theory of Codes

Theory of Codes
A characterization of complete finite prefix codes in an arbitrary submonoid of A

Journal of Automata, Languages and Combinatorics
Codes and sofic constraints

Theoretical Computer Science - The art of theory
Completing prefix codes in submonoids

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Completing circular codes in regular submonoids

Theoretical Computer Science
Cyclic renewal systems

Theoretical Computer Science
Complete codes in a sofic shift

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Completing a code in a regular submonoid of the free monoid

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality

Hi-index	5.23

Some results are given on maximal monoids in the language of the soficsystem generated by a finite code of words.