An efficient algorithm for finding kleene closure of regular expression matrices (Q4747532): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Survey of Regular Expressions and Their Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Boolean Matrices and the Stability of Neural Nets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5592246 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matrix Equations and Normal Forms for Context-Free Grammars / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Theorem on Boolean Matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3862379 / rank | |||
Normal rank | |||
Latest revision as of 18:38, 13 June 2024
scientific article; zbMATH DE number 3804880
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for finding kleene closure of regular expression matrices |
scientific article; zbMATH DE number 3804880 |
Statements
An efficient algorithm for finding kleene closure of regular expression matrices (English)
0 references
1982
0 references
Kleene closure
0 references
fuzzy regular expression matrices
0 references
automata theory
0 references
pattern recognition
0 references
