{"title":"带反转的公式的可避免性","authors":"J. Currie, Lucas Mol, N. Rampersad","doi":"10.1051/ita/2017013","DOIUrl":null,"url":null,"abstract":"While a characterization of unavoidable formulas (without reversal) is well-known, little is known about the avoidability of formulas with reversal in general. In this article, we characterize the unavoidable formulas with reversal that have at most two one-way variables ($x$ is a one-way variable in formula with reversal $\\phi$ if exactly one of $x$ and $x^R$ appears in $\\phi$).","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On avoidability of formulas with reversal\",\"authors\":\"J. Currie, Lucas Mol, N. Rampersad\",\"doi\":\"10.1051/ita/2017013\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"While a characterization of unavoidable formulas (without reversal) is well-known, little is known about the avoidability of formulas with reversal in general. In this article, we characterize the unavoidable formulas with reversal that have at most two one-way variables ($x$ is a one-way variable in formula with reversal $\\\\phi$ if exactly one of $x$ and $x^R$ appears in $\\\\phi$).\",\"PeriodicalId\":438841,\"journal\":{\"name\":\"RAIRO Theor. Informatics Appl.\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"RAIRO Theor. Informatics Appl.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1051/ita/2017013\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"RAIRO Theor. Informatics Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ita/2017013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
While a characterization of unavoidable formulas (without reversal) is well-known, little is known about the avoidability of formulas with reversal in general. In this article, we characterize the unavoidable formulas with reversal that have at most two one-way variables ($x$ is a one-way variable in formula with reversal $\phi$ if exactly one of $x$ and $x^R$ appears in $\phi$).