𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Inference of fuzzy regular pattern grammar

✍ Scribed by A.K Majumdar; A.K Roy

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
346 KB
Volume
2
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new regular grammar pattern matching a
A new regular grammar pattern matching algorithm
✍ Bruce W. Watson πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 155 KB

This paper presents a Boyer-Moore type algorithm for regular grammar pattern matching, answering a variant of an open problem posed by Aho (Pattern Matching in Strings, Academic Press, New York, 1980, p. 342). The new algorithm handles patterns speciΓΏed by regular (left linear) grammars-a generaliza

An inference method for fuzzy tree gramm
An inference method for fuzzy tree grammars
✍ Lan Shu πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 82 KB

The inference for fuzzy tree grammars is an important and di cult work. This paper gives an inference method for fuzzy tree grammars, which is composed of two parts. First, a fuzzy expansive tree grammar is generated from a sample set; second, the grammar is simpliΓΏed.