Displaying similar documents to “On a synonymy relation for extensional 1st order theories. Part 1. A notion of synonymy”

Synthesis of finite state machines for CPLDs

Robert Czerwiński, Dariusz Kania (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper presents a new two-step approach to FSM synthesis for PAL-based CPLDs that strives to find an optimum fit of an FSM to the structure of the CPLD. The first step, the original state assignment method, includes techniques of twolevel minimization and aims at area minimization. The second step, PAL-oriented multi-level optimization, is a search for implicants that can be shared by several functions. It is based on the graph of outputs. Results of experiments prove that the presented...

Non-free two-generator subgroups of SL(Q).

S. Peter Farbman (1995)

Publicacions Matemàtiques

Similarity:

The question of whether two parabolic elements A, B of SL(C) are a free basis for the group they generate is considered. Some known results are generalized, using the parameter τ = tr(AB) - 2. If τ = a/b ∈ Q, |τ| < 4, and |a| ≤ 16, then the group is not free. If the subgroup generated by b in Z / aZ has a set of representatives, each of which divides one of b ± 1, then the subgroup of SL(C) will not be free.

Knowledge discovery in data using formal concept analysis and random projections

Cherukuri Aswani Kumar (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this paper our objective is to propose a random projections based formal concept analysis for knowledge discovery in data. We demonstrate the implementation of the proposed method on two real world healthcare datasets. Formal Concept Analysis (FCA) is a mathematical framework that offers a conceptual knowledge representation through hierarchical conceptual structures called concept lattices. However, during the design of a concept lattice, complexity plays a major role.