Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (Q313770)
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: Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations |
scientific article; zbMATH DE number 6626371
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations |
scientific article; zbMATH DE number 6626371 |
Statements
Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (English)
0 references
12 September 2016
0 references
sequence binary decision diagram
0 references
persistent data structure
0 references
deterministic finite automaton
0 references
minimization
0 references
Boolean set operation
0 references
0.8803050518035889
0 references
0.8485830426216125
0 references
0.735323429107666
0 references
0.7326618432998657
0 references
0.7318521738052368
0 references
