Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships (Q1104114): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): journals/pr/KudoS88, #quickstatements; #temporary_batch_1731547958265
 
(4 intermediate revisions by 4 users not shown)
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/0031-3203(88)90053-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083201056 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59595143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammatical Inference: Introduction and Survey - Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Synthesis of Finite-State Machines from Samples of Their Behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient regular grammatical inference for pattern recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528329 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/pr/KudoS88 / rank
 
Normal rank

Latest revision as of 02:42, 14 November 2024

scientific article
Language Label Description Also known as
English
Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships
scientific article

    Statements

    Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships (English)
    0 references
    0 references
    0 references
    1988
    0 references
    New techniques for regular grammatical inference are proposed by the use of partial similarities among sample sentences and their logical relationships. These have an advantage to make clear the characteristic features of resultant automata to be inferred. The inference techniques including previous ones are classified from the point of views of the fidelity to samples and the efficiency of inference. It is also shown from examples that the proposed methods can be efficient according to these two criteria.
    0 references
    syntactic pattern recognition
    0 references
    regular grammar
    0 references
    grammatical inference
    0 references

    Identifiers