BOOLEAN FUZZY SETS-Reference-Cited by-同舟云学术

BOOLEAN FUZZY SETS

Published:2007-12 Issue:06 Volume:18 Page:1197-1207
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

ÉSIK ZOLTÁN¹²,KUICH WERNER³

Affiliation:

1. Dept. of Computer Science, University of Szeged, Árpád tér 2, 6720 Szeged, Hungary

2. GRLMC, Rovira i Virgili University, Pl. Imperial Tàrraco 1, 43005 Tarragona, Spain

3. Institut für Diskrete Mathematik und Geometrie, Technische Univarsität Wien, Wiedner Hauptstrasse 8–10, 1040 Wien, Austria

Abstract

Extending the notion of context-free languages and equational sets, we use the approximation theory to define boolean subsets and boolean fuzzy subsets of an algebra. We establish some basic properties of boolean fuzzy sets.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054107005248

Reference13 articles.

1. Iteration Theories

2. Equational Elements in Additive Algebras

3. On equations for regular languages, finite automata, and sequential networks

4. Asynchronous Circuits

5. Introduction to Lattices and Order

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Ternary Equational Languages;Implementation and Application of Automata;2016

2. Two-sided context specifications in formal grammars;Theoretical Computer Science;2015-08

3. An extension of context-free grammars with one-sided context specifications;Information and Computation;2014-10

4. Grammars with two-sided contexts;Electronic Proceedings in Theoretical Computer Science;2014-05-21

5. Parsing by matrix multiplication generalized to Boolean grammars;Theoretical Computer Science;2014-01