| dc.contributor.author |
Currie, James D. |
|
| dc.contributor.author |
Mol, Lucas |
|
| dc.contributor.author |
Rampersad, Narad |
|
| dc.date.accessioned |
2020-09-17T03:52:48Z |
|
| dc.date.available |
2020-09-17T03:52:48Z |
|
| dc.date.issued |
2018-02-13 |
|
| dc.identifier.citation |
James D. Currie, Lucas Mol, and Narad Rampersad. "On avoidability of formulas with reversal." RAIRO - Theoretical Informatics and Applications / Informatique Théorique et Applications 51(4) (2017): 181-189. DOI: 10.1051/ita/2017013. |
en_US |
| dc.identifier.issn |
0988-3754 |
|
| dc.identifier.uri |
http://hdl.handle.net/10680/1834 |
|
| dc.description.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 φ if exactly one of x and x^R appears in φ). |
en_US |
| dc.description.sponsorship |
"This work was supported by the Natural Sciences and Engineering Research Council of Canada (NSERC), grant numbers 418646-2012 and 42410-2010." |
en_US |
| dc.language.iso |
en |
en_US |
| dc.publisher |
EDP Sciences |
en_US |
| dc.rights |
info:eu-repo/semantics/openAccess |
en_US |
| dc.subject |
Pattern avoidance |
en_US |
| dc.subject |
公式与逆转 |
en_US |
| dc.subject |
Unavoidability |
en_US |
| dc.title |
在avoidabilityof formulas with reversal |
en_US |
| dc.type |
Article |
en_US |
| dc.identifier.doi |
https://doi.org/10.1051/ita/2017013 |
en_US |
