期刊： FUNDAMENTA INFORMATICAE, 2021; 179 (3)
Formal Concept Analysis (FCA) has been proven to be an effective method of restructuring complete lattices and various algebraic domains. In this pape......
期刊： FUNDAMENTA INFORMATICAE, 2021; 179 (3)
Varieties of topological quasi-Boolean algebras in the vicinity of pre-rough algebras [28, 29] are expanded to residuated algebraic structures by intr......
期刊： FUNDAMENTA INFORMATICAE, 2021; 179 (4)
Matroid theory is a useful tool for the combinatorial optimization issue in data mining, machine learning and knowledge discovery. Recently, combining......
期刊： FUNDAMENTA INFORMATICAE, 2021; 180 (1-2)
Weighted restarting automata have been introduced to study quantitative aspects of computations of restarting automata. In earlier works we studied th......
期刊： FUNDAMENTA INFORMATICAE, 2020; 174 (2)
Topological base plays a foundational role in topology theory. However, few works have been done to find the minimal base, which would make us difficu......
期刊： FUNDAMENTA INFORMATICAE, 2020; 175 (1-4)
We present the theory of distributed Markov chains (DMCs). A DMC consists of a collection of communicating probabilistic agents in which the synchroni......
期刊： FUNDAMENTA INFORMATICAE, 2020; 176 (1)
This paper studies the cluster ensemble selection problem for unsupervised learning. Given a large ensemble of clustering solutions, our goal is to se......
期刊： FUNDAMENTA INFORMATICAE, 2020; 176 (1)
ed from the nested structure of biological cells with application on the modeling of economical processes, numerical P systems (in short, NP systems) ......
期刊： FUNDAMENTA INFORMATICAE, 2020; 173 (1)
We propose two new measures of conditional connectivity to be the extension of Rg connectivity and R-g-edge-connectivity. Let G be a connected graph. ......
期刊： FUNDAMENTA INFORMATICAE, 2020; 177 (1)
"What is an algorithm?" is a fundamental question of computer science. Gurevich's behavioural theory of sequential algorithms (aka the sequential ASM ......
期刊： FUNDAMENTA INFORMATICAE, 2020; 176 (2)
For a network, edge/node-independent spanning trees (ISTs) can not only tolerate faulty edges/nodes, but also be used to distribute secure messages. A......
期刊： FUNDAMENTA INFORMATICAE, 2020; 177 (2)
The interval discrete logarithm problem(IDLP) is to find a solution n such that g(n) = h in a finite cyclic group G = < g >, where h is an eleme......
期刊： FUNDAMENTA INFORMATICAE, 2020; 177 (2)
The ability of identifying all the faulty devices in a multiprocessor system is known as diagnosability. The PMC model is the test-based diagnosis wit......
期刊： FUNDAMENTA INFORMATICAE, 2020; 172 (4)
Some scholars have proposed homomorphisms between information systems based on consistent functions. However, the binary relations in the codomain ind......
期刊： FUNDAMENTA INFORMATICAE, 2020; 171 (1-4)
P systems are a class of parallel computational models inspired by the structure and functioning of living cells, where all the evolution rules used i......
