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

DOI10.1108/eb005648zbMath0509.68073OpenAlexW1980400777MaRDI QIDQ4747531

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

fuzzy context-free grammarChomsky normal formsGreibach normal forms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

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

Cites Work

• Shape-oriented storage and retrieval of geometric figures and chromosome images
• Algorithms for finding most dissimilar images with possible applications to chromosome classification
• Shape-Oriented Chromosome Classification
• Matrix Equations and Normal Forms for Context-Free Grammars
• Decision-Making in a Fuzzy Environment
• A Theorem on Boolean Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item

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