default search action
Fundamenta Informaticae, Volume 111
Volume 111, Number 1, 2011
- Wei-Zhi Wu, Dominik Slezak, Hung Son Nguyen:
Preface. - Taichi Haruna, Yukio-Pegio Gunji:
Double Approximation and Complete Lattices. 1-14 - Tong-Jun Li, Wei-Zhi Wu:
Attribute Reduction in Formal Contexts: A Covering Rough Set Approach. 15-32 - Yanqing Yao, Ju-Sheng Mi, Zhoujun Li, Bin Xie:
The Construction of Fuzzy Concept Lattices Based on (θ, σ)-Fuzzy Rough Approximation Operators. 33-45 - Zhengjiang Wu, Tianrui Li, Keyun Qin, Da Ruan:
Approximation Operators, Binary Relation and Basis Algebra in L-fuzzy Rough Sets. 47-63 - Yong Du, Qinghua Hu, Degang Chen, Peijun Ma:
Kernelized Fuzzy Rough Sets Based Yawn Detection for Driver Fatigue Monitoring. 65-79 - Jian Yu, Miin-Shen Yang, Pengwei Hao:
A Novel Multimodal Probability Model for Cluster Analysis. 81-90 - Deepti Mishra, Alok Mishra:
Object-Oriented Inheritance Metrics in the Context of Cognitive Complexity. 91-117
Volume 111, Number 2, 2011
- Zhe Chen:
On the Generative Power of ω-Grammars and ω-Automata. 119-145 - Wit Forys, Piotr Oprocha:
Infinite Traces and Symbolic Dynamics - the Minimal Shift Case. 147-161 - Zoltán Fülöp, Andreas Maletti, Heiko Vogler:
Weighted Extended Tree Transducers. 163-202 - Benedetto Intrigila, Richard Statman:
Solution to the Range Problem for Combinatory Logic. 203-222 - Yanhong She, Xiaoli He, Guojun Wang:
Rough Truth Degrees of Formulas and Approximate Reasoning in Rough Logic. 223-239 - Jia Yu, Fanyu Kong, Xiangguo Cheng, Rong Hao, Jianxi Fan:
Forward-Secure Identity-Based Public-Key Encryption without Random Oracles. 241-256
Volume 111, Number 3, 2011
- Stefano Bistarelli, Francesco Santini:
A Nonmonotonic Soft Concurrent Constraint Language to Model the Negotiation Process. 257-279 - John Case, Samuel E. Moelius:
Properties Complementary to Program Self-Reference. 281-311 - Francisco Claude, Gonzalo Navarro:
Self-Indexed Grammar-Based Compression. 313-337 - Alessio Lomuscio, Wojciech Penczek, Monika Solanki, Maciej Szreter:
Runtime Monitoring of Contract Regulated Web Services. 339-355
Volume 111, Number 4, 2011
- Jean-Marc Champarnaud, Jacques Farré, Franck Guingne:
Reduction Techniques for Acyclic Cover Transducers. 357-371 - Zhi-Hong Deng, Ning Gao, Xiaoran Xu:
Mop: An Efficient Algorithm for Mining Frequent Pattern with Subtree Traversing. 373-390 - Aniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu:
Efficient Algorithms for Games Played on Trees with Back-edges. 391-412 - Manish Garg, Sugata Gangopadhyay:
A Lower Bound of the Second-order Nonlinearities of Boolean Bent Functions. 413-422 - Mihai Ionescu, Gheorghe Paun, Mario J. Pérez-Jiménez, Takashi Yokomori:
Spiking Neural dP Systems. 423-436 - Andrzej Kisielewicz, Marek Szykula:
Rainbow Induced Subgraphs in Proper Vertex Colorings. 437-451 - Taishin Yasunobu Nishida:
Computing k-block Morphisms by Spiking Neural P Systems. 453-464
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.