Applications of the Finite State Automata for Counting Restricted Permutations and Variations
Yugoslav journal of operations research, Tome 22 (2012) no. 2, p. 183
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
In this paper, we use the finite state automata to count the number of restricted
permutations and the number of restricted variations. For each type of restricted
permutations, we construct a finite state automaton able to recognize and enumerate
them. We, also, discuss how it encompasses the other known methods for enumerating
permutations with restricted position, and in one case, we establish connections with
some other combinatorial structures, such as subsets and compositions.
Classification :
11B85, 05A15, 05A05, 11B39
Keywords: Finite state automata, restricted permutations, restricted variations, exact enumeration.
Keywords: Finite state automata, restricted permutations, restricted variations, exact enumeration.
@article{YJOR_2012_22_2_a2,
author = {Vladimir Balti\'c},
title = {Applications of the {Finite} {State} {Automata} for {Counting} {Restricted} {Permutations} and {Variations}},
journal = {Yugoslav journal of operations research},
pages = {183 },
year = {2012},
volume = {22},
number = {2},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2012_22_2_a2/}
}
TY - JOUR AU - Vladimir Baltić TI - Applications of the Finite State Automata for Counting Restricted Permutations and Variations JO - Yugoslav journal of operations research PY - 2012 SP - 183 VL - 22 IS - 2 UR - http://geodesic.mathdoc.fr/item/YJOR_2012_22_2_a2/ LA - en ID - YJOR_2012_22_2_a2 ER -
Vladimir Baltić. Applications of the Finite State Automata for Counting Restricted Permutations and Variations. Yugoslav journal of operations research, Tome 22 (2012) no. 2, p. 183 . http://geodesic.mathdoc.fr/item/YJOR_2012_22_2_a2/