Regularity for a large class of context-free processes is decidable (Q4818834)
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 2102747
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Regularity for a large class of context-free processes is decidable |
scientific article; zbMATH DE number 2102747 |
Statements
24 September 2004
0 references
0.86561996
0 references
0.86561996
0 references
0.84622675
0 references
0.8458779
0 references
0.84330636
0 references
0.8407843
0 references
0.8393976
0 references
Regularity for a large class of context-free processes is decidable (English)
0 references