Bibliothek

X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    Digitale Medien
    Digitale Medien
    Regular-like tree expressions (1983)
    Springer
    International journal of parallel programming 12 (1983), S. 1-11 
    Details
    ISSN: 1573-7640
    Schlagwort(e): Trees ; regular expressions ; expansive tree grammars ; regularity-preserving transformations ; context-free languages
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract Regular-like expressions provide a compact notation for the explicit description of context-free languages. In this paper we extend these concepts by establishing a one-to-one correspondence between expansive tree languages and regular-like sets of trees. Algorithms are developed for constructing an expansive tree grammar whose language is defined by a given regular-like tree (RLT) expression, and vice versa. These results are then used to obtain RLT equations that describe sets of tree resulting from regularity-preserving transformations associated with three types of errors commonly found in practice.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF00996800
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 2
    Digitale Medien
    Digitale Medien
    Boolean difference techniques in fault tree analysis (1976)
    Springer
    International journal of parallel programming 5 (1976), S. 81-88 
    Details
    ISSN: 1573-7640
    Schlagwort(e): Boolean algebra ; Boolean difference ; component failure ; fault tree ; probability ; system reliability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract For an electrical, mechanical, or hybrid system described diagramatically as a network of interconnected components, fault tree modeling of system reliability as a function of individual component failure probabilities gives rise to logic expressions obtained from the network connections. Application of the method of Boolean differences in the analysis of such Boolean expressions is discussed, and it is shown that the influence of the status of specific components on the reliability of the total system may be investigated by straightforward algebraic operations on the network failure function.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF00991073
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 3
    Digitale Medien
    Digitale Medien
    Syntactic/semantic techniques in pattern recognition: A survey (1982)
    Springer
    International journal of parallel programming 11 (1982), S. 75-100 
    Details
    ISSN: 1573-7640
    Schlagwort(e): Attributes ; attributed grammars ; automata ; features ; formal languages ; grammatical inferrence ; linguistic ; pattern recognition ; probabilistic systems ; semantics ; stochastic systems ; structure ; syntax ; syntactic
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract This paper surveys some of the contemporary work in syntactic/semantic pattern recognition, with emphasis on four topics that are active research areas. These areas-grammatical inferrence, probabilistic models, syntactic errorcorrection, and grammars with attributes-present challenging questions both as to theory and as to practice.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF00995525
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 4
    Digitale Medien
    Digitale Medien
    An algorithm for the inference of tree grammars (1976)
    Springer
    International journal of parallel programming 5 (1976), S. 145-164 
    Details
    ISSN: 1573-7640
    Schlagwort(e): Tree grammars ; algorithm ; grammatical inference ; syntactic pattern recognition
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract An algorithm for the inference of tree grammars from sample trees is presented. The procedure, which is based on the properties of self-embedding and regularity, produces a reduced tree grammar capable of generating all the samples used in the inference process as well as other trees similar in structure. The characteristics of the algorithm are illustrated by experimental results.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF00975630
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...