Name
Abstract | ||
|---|---|---|
Motivated by the idea of describing parquet deformations using grammars, we define in this paper a terminal weighted grammar where the terminal generated at any step of a derivation is defined as a function of time. It is seen that terminal weighted regular grammars generate exactly the class of recursively enumerable sets. Terminal weighted matrix grammars are used to describe parquet deformations. The hierarchy of families generated by putting various restrictions on the functions is studied. |
Year | DOI | Venue |
|---|---|---|
1984 | 10.1007/3-540-13883-8_73 | FSTTCS |
Keywords | Field | DocType |
treating terminals,function values | Rule-based machine translation,Discrete mathematics,Computer science,Matrix (mathematics),Recursively enumerable language,Grammar,Hierarchy,Rectangular array | Conference |
Volume | ISSN | ISBN |
181 | 0302-9743 | 3-540-13883-8 |
Citations | PageRank | References |
2 | 0.62 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kamala Krithivasan | 1 | 409 | 70.83 |
| Anindya Das | 2 | 219 | 31.78 |