2023
DOI: 10.1007/s10849-023-09398-x
|View full text |Cite
|
Sign up to set email alerts
|

Relativized Adjacency

Abstract: HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des labor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
0
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 31 publications
(34 reference statements)
0
0
0
Order By: Relevance
“…Next consider grammars G which are sets of sets of k-factors and and say w |= G only if the k-factors in w are an element of G. Such a definition for the ◁, <, and < T relations yields the testable classes: locally k-testable (lt) [20], piecewise k-testable (pt) [24], or tier-based locally k, T -testable (tlt) [18], respectively. These classes are string extension learnable where f maps w to its k-factors, and ⊕ is set insertion [10].…”
Section: Model-theoretic Factors and Related Formal Language Classesmentioning
confidence: 99%
See 1 more Smart Citation
“…Next consider grammars G which are sets of sets of k-factors and and say w |= G only if the k-factors in w are an element of G. Such a definition for the ◁, <, and < T relations yields the testable classes: locally k-testable (lt) [20], piecewise k-testable (pt) [24], or tier-based locally k, T -testable (tlt) [18], respectively. These classes are string extension learnable where f maps w to its k-factors, and ⊕ is set insertion [10].…”
Section: Model-theoretic Factors and Related Formal Language Classesmentioning
confidence: 99%
“…These classes are well-studied subregular classes which often have multiple characterizations, including language-theoretic, automatatheoretic, logical, and algebraic. The classes used to exemplify this work include the Strictly Local languages [20], the Strictly Piecewise languages [23], and the Tier-Based Strictly Local languages [13,18].…”
Section: Introductionmentioning
confidence: 99%