Name
Abstract | ||
|---|---|---|
In this paper we prove that the language of all primitive (strongly primitive) words over a nontrivial alphabet can be generated by certain types of Marcus contextual grammars. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2007.09.006 | Discrete Mathematics |
Keywords | Field | DocType |
automata,combinatorics of words and languages,strongly primitive words,formal languages,marcus contextual grammars and languages,primitive words,formal language | Rule-based machine translation,Discrete mathematics,Formal language,Automaton,Mathematics,Alphabet | Journal |
Volume | Issue | ISSN |
308 | 21 | Discrete Mathematics |
Citations | PageRank | References |
8 | 0.69 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pál Dömösi | 1 | 39 | 16.25 |
| Masami Ito | 2 | 299 | 66.19 |
| Solomon Marcus | 3 | 95 | 19.87 |