On fixed points of rational transductions

DOI10.1016/J.TCS.2018.04.030zbMath1412.03019OpenAlexW2802922619WikidataQ129911783 ScholiaQ129911783MaRDI QIDQ1637233

Vesa Halava, Esa Sahla, Tero J.Harju

Publication date: 7 June 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.04.030

zbMATH Keywords

fixed pointsdecidabilitypost correspondence problemrational transductionsinjective PCP

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Undecidability and degrees of sets of sentences (03D35)

Cites Work

• A variant of a recursively unsolvable problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On fixed points of rational transductions