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

Computing the partial word avoidability indices of binary patterns

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

DOI10.1016/j.jda.2013.06.007zbMath1334.68166OpenAlexW2175080963MaRDI QIDQ396698

Shane Scott, Andrew Lohr, Francine Blanchet-Sadri

Publication date: 13 August 2014

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2013.06.007

zbMATH Keywords

pattern avoidancecombinatorics on wordsavoidability indexpartial wordsbinary pattern


Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)


Related Items

On the aperiodic avoidability of binary patterns with variables and reversals, Computing the partial word avoidability indices of ternary patterns, Computing Depths of Patterns, Pattern occurrence statistics and applications to the Ramsey theory of unavoidable patterns



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Avoidable binary patterns in partial words
  • Erratum to: ``Avoidable binary patterns in partial words
  • Avoidable patterns in strings of symbols
  • Computing the Partial Word Avoidability Indices of Ternary Patterns
  • BLOCKING SETS OF TERMS
  • Algorithmic Combinatorics on Partial Words
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:396698&oldid=12267813"
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 04:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki