We prove that the complement of a commutative language L is context-free if the Parikh-map of L is a proper linear set. Some sharpenings to results considering the Fliess conjecture on commutative contextfree languages are given. A conjecture concerning commutative star languages is disproved by a c
โฆ LIBER โฆ
On commutative context-free languages
โ Scribed by J. Beauquier; M. Blattner; M. Latteux
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 620 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Remarks about Commutative Context-Free L
โ
Juha Kortelainen
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 205 KB
Approximately matching context-free lang
โ
Gene Myers
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 609 KB
Context-free languages and random walks
โ
Wolfgang Woess
๐
Article
๐
1987
๐
Elsevier Science
๐
English
โ 435 KB
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.
Context-Free Languages of Sub-exponentia
โ
Martin R. Bridson; Robert H. Gilman
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 65 KB
Logical Description of Context-free Grap
โ
Joost Engelfriet; Vincent van Oostrom
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 378 KB
An attribute evaluation of context-free
โ
Takehiro Tokuda; Yoshimichi Watanabe
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 575 KB