Grammatical inference of directed acyclic graph languages with polynomial time complexity (Q1747486): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:47, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Grammatical inference of directed acyclic graph languages with polynomial time complexity |
scientific article |
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
