Two decidability problems for infinite words (Q1072715)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two decidability problems for infinite words |
scientific article; zbMATH DE number 3943057
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two decidability problems for infinite words |
scientific article; zbMATH DE number 3943057 |
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
