An Improved Proof of the Closure Under Homomorphic Inverse of FCFL Valued in Lattice-Ordered Monoids

DOI10.1007/978-981-15-0105-0_5zbMath1452.68110OpenAlexW2970920732MaRDI QIDQ3305472

Ping Li, Luyao Zhao, Haihui Wang

Publication date: 7 August 2020

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-15-0105-0_5

zbMATH Keywords

closure propertyfuzzy context-free languagelattice-ordered monoidfuzzy pushdown automatahomomorphic inverse

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
• Grammar theory based on lattice-ordered monoid
• Automata theory based on complete residuated lattice-valued logic: a categorical approach
• Fuzzy grammars and recursively enumerable fuzzy languages
• L-fuzzy grammars
• Fuzzy automata and languages
• A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata
• Algebraic aspects of families of fuzzy languages
• Fuzzy grammar theory based on lattices
• The relationships among several types of fuzzy automata
• Algebraic properties of \(LA\)-languages
• Fuzzy context-free languages. I: Generalized fuzzy context-free grammars
• Maximin automata
• On context-free languages and push-down automata
• Fuzzy pushdown automata

This page was built for publication: An Improved Proof of the Closure Under Homomorphic Inverse of FCFL Valued in Lattice-Ordered Monoids