On the union of 0L languages (Q685483)
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 417396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the union of 0L languages |
scientific article; zbMATH DE number 417396 |
Statements
On the union of 0L languages (English)
0 references
9 June 1994
0 references
The authors treat the problem of union of two 0L languages. They show that in general this question is undecidable and that it becomes decidable in the case of PD0L languages and languages over unary alphabets. The following are the main results: Theorem 1. For arbitrarily given (P)0L languages L1 and L2, it is undecidable whether L1 \(\cup\) L2 is a 0L language (or a P0L language). Theorem 2. It is decidable whether or not the union of two PD0L languages is a PD0L language. Theorem 3. Given two 0L languages over a unary alphabet it is decidable whether or not their union is 0L language.
0 references
L systems
0 references
decidability
0 references
AFL
0 references
union
0 references
0.89500076
0 references
0.88885087
0 references
0 references
0.8527405
0 references
0.8503131
0 references
0.8491969
0 references
