108 search results - page 5 / 22 » Constructing Free Boolean Categories |
115
Voted
DAC
2003
ACM
16 years 4 months ago
2003
ACM
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
138
Voted
GLVLSI
2007
IEEE
15 years 10 months ago
2007
IEEE
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
162
Voted
EMSOFT
2011
Springer
14 years 3 months ago
2011
Springer
Motivated by improvements in constraint-solving technology and by the increase of routinely available computational power, partial-program synthesis is emerging as an effective a...
139
click to vote
CALCO
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we identify context-free grammars as coalgebras. To obtain the associated context-free languages (consisting of only finite-length strings) we introduce a general a...
140
Voted
ENTCS
2010
15 years 4 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...