The insertion encoding of permutations.
Albert, Michael H., Linton, Steve, Ruskuc, Nik (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Applications of the Finite State Automata for Counting Restricted Permutations and Variations”
The insertion encoding of permutations.
Sorting with a forklift.
Albert, M.H., Atkinson, M.D. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Permutations generated by a stack of depth 2 and an infinite stack in series.
Elder, Murray (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A survey of stack-sorting disciplines.
Bóna, Miklós (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Combinatorial interpretations of a generalization of the Genocchi numbers.
Domaratzki, Michael (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Permutation reconstruction.
Smith, Rebecca (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The factor automaton
Milan Šimánek (2002)
Kybernetika
Similarity:
This paper concerns searching substrings in a string using the factor automaton. The factor automaton is a deterministic finite automaton constructed to accept every substring of the given string. Nondeterministic factor automaton is used to achieve new operations on factor automata for searching in non-constant texts.
On the product of all elements in a finite group.
Dömösi, Pál (2001)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Synthesis of non-initial automata
Ján Černý (1967)
Kybernetika
Similarity: