Proves that for any fixed bounds on degree and structural parameters, graph languages from FICSs satisfying the finite context property are identifiable in the limit from positive data plus membership queries, with polynomial-time learner updates.
Parameterized formal graph systems 38 and their polynomial-time pac learnability.IEICE Transactions on Fundamentals, E106-A(6):896–906, June 2023
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems
Proves that for any fixed bounds on degree and structural parameters, graph languages from FICSs satisfying the finite context property are identifiable in the limit from positive data plus membership queries, with polynomial-time learner updates.