Parallel algorithms for minimal nondeterministic finite automata inference (Q4989176)
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: Parallel algorithms for minimal nondeterministic finite automata inference |
scientific article; zbMATH DE number 7350473
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel algorithms for minimal nondeterministic finite automata inference |
scientific article; zbMATH DE number 7350473 |
Statements
Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference (English)
0 references
21 May 2021
0 references
parallel algorithms
0 references
learning regular languages
0 references
nondeterministic finite automata
0 references
constraint satisfaction problem
0 references
satisfiability problem
0 references
grammatical inference
0 references
0.8300582766532898
0 references
0.8258658647537231
0 references
0.8059465885162354
0 references
