Two decidability problems for infinite words (Q1072715): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3859267 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Adherences of languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Equivalence problems for mappings on infinite strings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some decidability results about regular and pushdown translations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Relations rationnelles infinitaires / rank | |||
Normal rank | |||
Latest revision as of 13:17, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two decidability problems for infinite words |
scientific article |
Statements
Two decidability problems for infinite words (English)
0 references
1986
0 references
The aim of the present paper is to establish the following results: 1. The emptiness problem of the \(\omega\)-equality set of two morphisms is unsolvable or, in an equivalent way, that the \(\omega\)-Post correspondence problem is unsolved. 2. The property to be functional for an infinitary rational relation is solvable.
0 references
infinitary language
0 references
omega-equality set
0 references
emptiness problem
0 references
Post correspondence problem
0 references
infinitary rational relation
0 references
