Further applications of a power series method for pattern avoidance.
Rampersad, Narad (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Rationality, irrationality, and Wilf equivalence in generalized factor order.”
Further applications of a power series method for pattern avoidance.
A Hierarchy of Automatic -Words having a Decidable MSO Theory
Vince Bárány (2008)
RAIRO - Theoretical Informatics and Applications
Similarity:
We investigate automatic presentations of -words. Starting points of our study are the works of Rigo and Maes, Caucal, and Carton and Thomas concerning lexicographic presentation, MSO-interpretability in algebraic trees, and the decidability of the MSO theory of morphic words. Refining their techniques we observe that the lexicographic presentation of a (morphic) word is in a certain sense canonical. We then generalize our techniques to a hierarchy of classes of -words enjoying...
Abstract numeration systems on bounded languages and multiplication by a constant.
Charlier, Emilie, Rigo, Michel, Steiner, Wolfgang (2008)
Integers
Similarity:
The insertion encoding of permutations.
Albert, Michael H., Linton, Steve, Ruskuc, Nik (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The umbral transfer-matrix method. V: The Goulden-Jackson cluster method for infinitely many mistakes.
Zeilberger, Doron (2002)
Integers
Similarity:
Iteration of rational transductions
Alain Terlutte, David Simplot (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Counting words by number of occurrences of some patterns.
Gao, Zhicheng, MacFie, Andrew, Panario, Daniel (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels.
Bousquet-Mélou, Mireille (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Meanders and Motzkin words.
Panayotopoulos, A., Tsikouras, P. (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Undecidability of the equivalence of finite substitutions on regular language
Vesa Halava, Tero Harju (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A note on antichains of words.
Currie, James D. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Applications of the Finite State Automata for Counting Restricted Permutations and Variations
Vladimir Baltić (2012)
The Yugoslav Journal of Operations Research
Similarity: