Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

The structure of infinite solutions of marked and binary Post correspondence problems

From MaRDI portal
Publication:866910
Jump to:navigation, search

DOI10.1007/S00224-005-1222-6zbMath1107.03048OpenAlexW1998945671MaRDI QIDQ866910

Juhani Karhumäki, Vesa Halava, Tero J.Harju

Publication date: 14 February 2007

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-005-1222-6




Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Word problems, etc. in computability and recursion theory (03D40) Thue and Post systems, etc. (03D03)



Related Items (1)

Extension of the decidability of the marked PCP to instances with unique blocks





This page was built for publication: The structure of infinite solutions of marked and binary Post correspondence problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:866910&oldid=12813224"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 16:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki