Name
Abstract | ||
|---|---|---|
In this paper, we define the n-insertion ADelta([n]) B of a language A into a language B and provide some properties of n-insertions. For instance, the n-insertion of a regular language into a regular language is regular but the n-insertion of a context-free language into a context-free language is not always context-free. However, it can be shown that the n-insertion of a regular (context-free) language into a context-free (regular) language is context-free. We also consider the decomposition of regular languages under n-insertion. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-24635-0_15 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
context free language,regular language | Discrete mathematics,Context-free language,Programming language,Computer science,Natural language processing,Artificial intelligence,Regular language | Conference |
Volume | ISSN | Citations |
2950 | 0302-9743 | 2 |
PageRank | References | Authors |
0.41 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masami Ito | 1 | 299 | 66.19 |
| Ryo Sugiura | 2 | 2 | 0.41 |