Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Avoidability index for binary patterns with reversal

From MaRDI portal
Publication:252854
Jump to:navigation, search

zbMath1332.68177arXiv1508.02101MaRDI QIDQ252854

Philip Lafrance, James D. Currie

Publication date: 4 March 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.02101


zbMATH Keywords

combinatorics on wordsreversalswords avoiding patterns


Mathematics Subject Classification ID

Combinatorics on words (68R15)


Related Items

On the aperiodic avoidability of binary patterns with variables and reversals ⋮ Avoidance bases for formulas with reversal ⋮ The undirected repetition threshold and undirected pattern avoidance ⋮ A family of formulas with reversal of high avoidability index ⋮ On avoidability of formulas with reversal ⋮ Formulas with reversal



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
  • Growth rate of binary words avoiding \(xxx^{R}\)
  • Avoidable patterns in strings of symbols
  • Every binary pattern of length six is avoidable on the two-letter alphabet
  • Unavoidable binary patterns
  • How many squares must a binary sequence contain?
  • Pattern Avoidability with Involution
  • UNARY PATTERNS WITH INVOLUTION
  • The Avoidability of Cubes under Permutations
  • BLOCKING SETS OF TERMS
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:252854&oldid=12142549"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 02:34.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki