An undecidable problem about rational sets and contour words of polyominoes (Q751298)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:751298 |
scientific article; zbMATH DE number 4176467
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An undecidable problem about rational sets and contour words of polyominoes |
scientific article; zbMATH DE number 4176467 |
Statements
An undecidable problem about rational sets and contour words of polyominoes (English)
0 references
1991
0 references
combinatorial problems
0 references
formal languages
0 references
0.7474108934402466
0 references
0.7440962791442871
0 references
0.7415300011634827
0 references
0.7368344068527222
0 references
0.7245710492134094
0 references
