Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2915601
Jump to:navigation, search

zbMath1265.05007MaRDI QIDQ2915601

Dominique Rossin, Adeline Pierrot, Frédérique Bassino, Mathilde Bouvel

Publication date: 18 September 2012


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmautomatasimple permutationspermutation classespin words


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Formal languages and automata (68Q45)


Related Items (3)

Automatic discovery of structural rules of permutation classes ⋮ An algorithm computing combinatorial specifications of permutation classes ⋮ An algorithm for deciding the finiteness of the number of simple permutations in permutation classes


Uses Software

  • InsEnc



This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2915601&oldid=15889940"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki