Extensions of sokolowski's theorem to prove languages are not context free or not regular (Q3957965): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207168208803309 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2038743525 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198075 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A method for proving programming languages non context-free / rank | |||
Normal rank | |||
Latest revision as of 16:53, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extensions of sokolowski's theorem to prove languages are not context free or not regular |
scientific article |
Statements
Extensions of sokolowski's theorem to prove languages are not context free or not regular (English)
0 references
1982
0 references
context-free language
0 references
necessary condition
0 references
pumping lemma
0 references
non-context- freeness
0 references
