Finitely distinguishable erasing pattern languages (Q2290682): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2019.11.011 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2019.11.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2984492834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding patterns common to a set of strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the Arithmetical Complexity of Teaching Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern matching with variables: a multivariate complexity analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bad news on decision problems for patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing pattern languages with membership examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5361292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the teaching complexity of linear sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Regular Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of teaching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Teaching a smarter learner. / rank
 
Normal rank
Property / cites work
 
Property / cites work: CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular patterns, regular languages and context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern languages with and without erasing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems for patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning erasing pattern languages with queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence problem for E-pattern languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-learnable class of E-pattern languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discontinuities in pattern inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular and context-free pattern languages over small alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Teachability in computational learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4749224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396611 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2019.11.011 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:41, 17 December 2024

scientific article
Language Label Description Also known as
English
Finitely distinguishable erasing pattern languages
scientific article

    Statements

    Finitely distinguishable erasing pattern languages (English)
    0 references
    0 references
    0 references
    0 references
    29 January 2020
    0 references
    pattern languages
    0 references
    teaching dimension
    0 references
    recursive teaching dimension
    0 references

    Identifiers