The Sequence Equivalence Problem is Decidable for 0S Systems (Q3926053)
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 3738934
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Sequence Equivalence Problem is Decidable for 0S Systems |
scientific article; zbMATH DE number 3738934 |
Statements
The Sequence Equivalence Problem is Decidable for 0S Systems (English)
0 references
1980
0 references
context-free grammars
0 references
decision problems
0 references
