Sciweavers

307 search results - page 42 / 62
» Finite locally-quasiprimitive graphs
Sort
View
FUIN
2006
125views more  FUIN 2006»
13 years 9 months ago
Associative Omega-product of Processes
The notion of an associative omega-product is applied to processes. Processes are one of the ways to represent behavior of Petri nets. They have been studied for some years as an ...
Roman R. Redziejowski
MFCS
1998
Springer
14 years 2 months ago
Facial Circuits of Planar Graphs and Context-Free Languages
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
Bruno Courcelle, Denis Lapoire
ALT
1994
Springer
14 years 2 months ago
Program Synthesis in the Presence of Infinite Number of Inaccuracies
Most studies modeling inaccurate data in Gold style learning consider cases in which the number of inaccuracies is finite. The present paper argues that this approach is not reaso...
Sanjay Jain
ACSD
2007
IEEE
109views Hardware» more  ACSD 2007»
14 years 1 months ago
Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings
Synthesis of asynchronous circuits from Signal Transition Graphs (STGs) involves resolution of state encoding conflicts by means of refining the STG specification. In this paper, ...
Victor Khomenko
CIE
2009
Springer
14 years 1 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch