Applications of the finite state automata for counting restricted permutations and variations

DOI10.2298/YJOR120211023BMaRDI QIDQ5259332zbMATH OpenWikidataFDO

Authors Vladimir Baltić

Publication date 26 June 2015

Published in Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/YJOR120211023B

zbMATH Keywords

exact enumerationrestricted variations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Automata sequences (11B85)

Recommendations

• Applications of the finite state automata in the enumerative combinatorics
• Applications of the theory of automata in enumeration
• Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations
• Applications in enumerative combinatorics of infinite weighted automata and graphs
• scientific article; zbMATH DE number 4209603
• scientific article; zbMATH DE number 4092773
• scientific article; zbMATH DE number 3934415
• Operations on Permutation Automata
• On the number of accepting states of finite automata
• scientific article; zbMATH DE number 822047

Cited in

(4)

• Permutations with restricted movement
• Finite automata for languages of combinatorial interest: An order theoretical point of view
• Applications of the finite state automata in the enumerative combinatorics
• Connections between combinations without specified separations and strongly restricted permutations, compositions, and bit strings

This page was built for publication: Applications of the finite state automata for counting restricted permutations and variations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259332)