On the commutative equivalence of bounded context-free and regular languages: the code case (Q476875): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/J.TCS.2014.10.005 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.TCS.2014.10.005 / rank | |||
Normal rank |
Latest revision as of 18:41, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the commutative equivalence of bounded context-free and regular languages: the code case |
scientific article |
Statements
On the commutative equivalence of bounded context-free and regular languages: the code case (English)
0 references
2 December 2014
0 references
bounded context-free language
0 references
semilinear set
0 references
commutative equivalence
0 references
0 references