Post correspondence problem: words possible as primitive solutions
From MaRDI portal
Publication:4645167
DOI10.1007/3-540-60084-1_63zbMATH Open1415.03048OpenAlexW1529388494MaRDI QIDQ4645167FDOQ4645167
Authors: Marjo Lipponen 
Publication date: 10 January 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60084-1_63
Recommendations
Automata and formal grammars in connection with logical questions (03D05) Undecidability and degrees of sets of sentences (03D35)
Cites Work
- A Purely Homomorphic Characterization of Recursively Enumerable Sets
- Title not available (Why is that?)
- A variant of a recursively unsolvable problem
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Title not available (Why is that?)
- Title not available (Why is that?)
- On simplest possible solutions for Post Correspondence Problems
- Title not available (Why is that?)
- PCP-prime words and primality types
- Title not available (Why is that?)
Cited In (10)
- Sets of primitive words given by fixed points of mappings
- On F-prime solutions of the Post correspondence problem
- Reduction tree of the binary generalized post correspondence problem
- Title not available (Why is that?)
- On Vaughan Pratt's crossword problem
- Title not available (Why is that?)
- Decision problems concerning prime words and languages of the Post Correspondence Problems
- Post correspondence problem with partially commutative alphabets
- Flatwords and Post Correspondence Problem
- Strongly prime PCP words
This page was built for publication: Post correspondence problem: words possible as primitive solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645167)
