๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Undecidability of the trace coding problem and some decidable cases

โœ Scribed by Michal Kunc

Book ID
108280887
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
678 KB
Volume
310
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The undecidability of some equivalence p
The undecidability of some equivalence problems concerning ngsm's and finite substitutions
โœ P. Turakainen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 437 KB

It is shown to be undecidable whether an c-free finite substitution and a two-state simple E-free ngsm are equivalent on {a, b}\*. Consequently, the state-minimization of such ngsm's and the nonterminal-minimization of linear grammars having two nonterminals are undecidable. Applications to some ot

Some undecidable problems involving the
Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
โœ Stefan A. Burr ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 477 KB

Certain problems involving the coloring the edges or vertices of infinite graphs are shown to be undecidable. In particular, let G and H be finite 3-connected graphs, or triangles. Then a doubly-periodic infinite graph F is constructed such that the following problem is undecidable: For a coloring o