ALGORITHMS FOR FINDING CHOMSKY AND GREIBACH NORMAL FORMS FOR A FUZZY CONTEXT‐FREE GRAMMAR USING AN ALGEBRAIC APPROACH

DOI10.1108/EB005648MaRDI QIDQ4747531zbMATH OpenOpenAlexFDO

Authors Edward T. Lee

Publication date 1983

Published in Kybernetes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1108/eb005648

zbMATH Keywords

Chomsky normal formsfuzzy context-free grammarGreibach normal forms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A Theorem on Boolean Matrices
• Algorithms for finding most dissimilar images with possible applications to chromosome classification
• Decision-Making in a Fuzzy Environment
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3750248 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Matrix Equations and Normal Forms for Context-Free Grammars
• Shape-Oriented Chromosome Classification
• Shape-oriented storage and retrieval of geometric figures and chromosome images

Cited in

(1)

• PROOF OF A FUZZY REGULAR LANGUAGE THEOREM BY USING LEVEL SETS—A NOTE

This page was built for publication: ALGORITHMS FOR FINDING CHOMSKY AND GREIBACH NORMAL FORMS FOR A FUZZY CONTEXT‐FREE GRAMMAR USING AN ALGEBRAIC APPROACH

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4747531)