Efficient divide-and-conquer implementations of symmetric FSAs (Q3589613)
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: Efficient divide-and-conquer implementations of symmetric FSAs |
scientific article; zbMATH DE number 5788652
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient divide-and-conquer implementations of symmetric FSAs |
scientific article; zbMATH DE number 5788652 |
Statements
20 September 2010
0 references
finite state automaton
0 references
deterministic automaton
0 references
symmetric automaton
0 references
sequential automaton
0 references
networks of automata
0 references
0.7004536390304565
0 references
