UNARY PATTERNS WITH INVOLUTION-Reference-Cited by-同舟云学术

UNARY PATTERNS WITH INVOLUTION

Published:2012-12 Issue:08 Volume:23 Page:1641-1652
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

BISCHOFF BASTIAN¹,CURRIE JAMES²,NOWOTKA DIRK³

Affiliation:

1. Institute for Formal Methods in Computer Science, Universität Stuttgart, Universitätsstr. 38, D-70569 Stuttgart, Germany

2. Department of Mathematics, University of Winnipeg, Winnipeg, Manitoba, R3B 2E9, Canada

3. Department of Computer Science, Christian-Albrechts-Universität zu Kiel, D-24098 Kiel, Germany

Abstract

An infinite word w avoids a pattern p with the involution if there is no substitution for the variables in p and no involution on substituted variables such that the resulting word is a factor of w. An avoidance index of pattern p is the smallest alphabet size for which a word exists such that p is avoided. A pattern is called unary, if only one variable occurs in it. In this paper, we give the avoidance indices for all unary patterns with involution.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054112400679

Reference3 articles.

1. Finite-valued Logics for Information Processing

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Unary patterns under permutations;Theoretical Computer Science;2018-09

2. On the aperiodic avoidability of binary patterns with variables and reversals;Theoretical Computer Science;2017-06

3. The extended equation of Lyndon and Schützenberger;Journal of Computer and System Sciences;2017-05

4. Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability;Theoretical Computer Science;2017-01

5. Growth rate of binary words avoiding xxx;Theoretical Computer Science;2016-01