On simulating non-returning PC grammar systems with returning systems
✍ Scribed by György Vaszil
- Book ID
- 104326341
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 754 KB
- Volume
- 209
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
Non-returning PC grammar systems with n context free components are simulated in [3] by returning PC grammar systems with 4n2 -3n + 1 components. In this paper we reduce the number of components of the simulating system by using a different simulating construction.
The number of simulating components can be further decreased if the queries appearing in some of the components satisfy a simple condition, which all queries in regular and linear grammars naturally do. This number can be as low as 2n, while in general it is still (n + 1)2.
📜 SIMILAR VOLUMES
The bushing of a transformer is one part of the transformer system, but is as vital as the transformer itself because it forms a part of the main circuit. Deterioration and abnormal condition of the bushing possibly cause its destruction, shortage of the main circuit to the Earth, and fire in the sy