Computing growth functions of braid monoids and counting vertex-labelled bipartite graphs (Q1758515)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing growth functions of braid monoids and counting vertex-labelled bipartite graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing growth functions of braid monoids and counting vertex-labelled bipartite graphs |
scientific article |
Statements
Computing growth functions of braid monoids and counting vertex-labelled bipartite graphs (English)
0 references
9 November 2012
0 references
braid monoid
0 references
growth function
0 references
finite state automaton
0 references
normal form acceptor
0 references
transition matrix
0 references
vertex-labelled bipartite graphs
0 references
0.7470273375511169
0 references
0.7454743981361389
0 references
0.7405584454536438
0 references
0.7386066317558289
0 references
