Name
Abstract | ||
|---|---|---|
LetX be a finite alphabet and letX* be the free monoid generated byX. A languageA
<img src="/fulltext-image.asp?format=htmlnonpaginated&src=J1M207728GL12060_html\10766_2004_Article_BF00976221_TeX2GIFIE1.gif" border="0" alt="
$$ \subseteq $$
" />X* is called left-noncounting if there existsk ≥ 0 such that forx,y εX*,xky εA if and only ifxk+iy εA. The class of all left-noncounting languages overX forms a Boolean algebra which generally contains properly the class of all noncounting languages overX and is properly contained in the class of all power-separating languages overX. In this paper, we discuss some relations among these three classes of languages and we characterize the automata accepting the left-noncounting languages and the syn tactic monoids of the left-noncounting languages. |
Year | DOI | Venue |
|---|---|---|
1975 | 10.1007/BF00976221 | International Journal of Parallel Programming |
Keywords | Field | DocType |
automaton,left-noncounting language,disjunctive subset,free monoid,com- binatorial monoid,power-separating language,syntactic monoid,left combinatorial monoid.,code,combinatorial right congruence,regular language,boolean algebra | Discrete mathematics,Computer science,Abstract family of languages,Theoretical computer science,Monoid,Boolean algebra,Rewriting,Syntactic monoid,Regular language,Free monoid,Trace theory | Journal |
Volume | Issue | Citations |
4 | 1 | 2 |
PageRank | References | Authors |
0.58 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| H. J. Shyr | 1 | 2 | 0.58 |
| G. Thierrin | 2 | 68 | 10.18 |