Abstract
Post's Embedding Problem is a new variant of Post's Correspondence Problem where words are compared with embedding rather than equality. It has been shown recently that adding regular constraints on the form of admissible solutions makes the problem highly non-trivial, and relevant to the study of lossy channel systems. Here we consider the infinitary version and its application to recurrent reachability in lossy channel systems. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Chambart, P., & Schnoebelen, P. (2008). The ω-regular post embedding problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4962 LNCS, pp. 97–111). https://doi.org/10.1007/978-3-540-78499-9_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
