Learning Indexed Families of Recursive Languages from Positive Data¶
Lange, S., Zeugmann, T., & Zilles, S. Learning Indexed Families of Recursive Languages from Positive Data.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Finite Thickness
- Neither the whole class nor each member language has to be finite.
This sourceFull text inspected; the cited nonerasing restricted-expression class has finite thickness, while the erasing class does not.
- Neither the whole class nor each member language has to be finite.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:3a13dac0c7b3 · see in the full table