On the commutative equivalence of bounded context-free and regular languages: the code case (Q476875): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q45 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6375985 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
bounded context-free language | |||
| Property / zbMATH Keywords: bounded context-free language / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
semilinear set | |||
| Property / zbMATH Keywords: semilinear set / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
commutative equivalence | |||
| Property / zbMATH Keywords: commutative equivalence / rank | |||
Normal rank | |||
Revision as of 18:11, 30 June 2023
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
