Counting Occurrences of a Pattern of Length Three with at most two Distinct Letters in a k-ary Word

Sorry, there's nothing here.

Cite this paper

@article{Mansour2016CountingOO, title={Counting Occurrences of a Pattern of Length Three with at most two Distinct Letters in a k-ary Word}, author={Toufik Mansour and Armend Shaban Shabani}, journal={Journal of Automata, Languages and Combinatorics}, year={2016}, volume={21}, pages={183-201} }