It is decidable whether or not a permutation-free morphism is an l code (Q4734778)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4121468
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | It is decidable whether or not a permutation-free morphism is an l code |
scientific article; zbMATH DE number 4121468 |
Statements
It is decidable whether or not a permutation-free morphism is an l code (English)
0 references
1987
0 references
morphism in languages
0 references
decidability ambiguity
0 references
L code
0 references
0.8116781115531921
0 references
0.771384596824646
0 references
0.7500855922698975
0 references
