On context-free and Szilard languages
✍ Scribed by Erkki Mäkinen
- Publisher
- Springer Netherlands
- Year
- 1984
- Tongue
- English
- Weight
- 395 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0006-3835
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A bracketed grammar is a context-free grammar in which indexed brackets are inserted around the right-hand sides of the rules. The language generated by a bracketed grammar is a bracketed language. An algebraic condition is given for one bracketed language to be a subset of another. The intersection
The Green function of an arbitrary, finitely supported random walk on a discrete group with context-free word problem is algebraic. It is shown how this theorem can be deduced from basic results of formal language theory. Context-free groups are precisely the finite extensions of free groups.