Grammatical inference of directed acyclic graph languages with polynomial time complexity (Q1747486)
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: Grammatical inference of directed acyclic graph languages with polynomial time complexity |
scientific article; zbMATH DE number 6866848
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Grammatical inference of directed acyclic graph languages with polynomial time complexity |
scientific article; zbMATH DE number 6866848 |
Statements
Grammatical inference of directed acyclic graph languages with polynomial time complexity (English)
0 references
8 May 2018
0 references
graph languages
0 references
graph automata
0 references
grammatical inference
0 references
\(k\)-testable languages
0 references
0 references
0.7601615786552429
0 references
0.7568222880363464
0 references
0.750292181968689
0 references
