Sciweavers

119 search results - page 5 / 24
» On finite alphabets and infinite bases
Sort
View
ACSD
2008
IEEE
135views Hardware» more  ACSD 2008»
13 years 11 months ago
Synthesis of Petri nets from infinite partial languages
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...
Robin Bergenthum, Jörg Desel, Robert Lorenz, ...
LPAR
2010
Springer
13 years 7 months ago
Infinite Families of Finite String Rewriting Systems and Their Confluence
We introduce parameterized rewrite systems for describing infinite families of finite string rewrite systems depending upon non-negative integer parameters, as well as ways to reas...
Jean-Pierre Jouannaud, Benjamin Monate
DLT
2007
13 years 11 months ago
State Complexity of Union and Intersection of Finite Languages
Abstract. We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. We ...
Yo-Sub Han, Kai Salomaa
TSP
2010
13 years 4 months ago
Algebraic signal processing theory: sampling for infinite and finite 1-D space
We derive a signal processing framework, called space signal processing, that parallels time signal processing. As such, it comes in four versions (continuous/discrete, infinite/fi...
Jelena Kovacevic, Markus Püschel
GLOBECOM
2008
IEEE
14 years 4 months ago
Physical Layer Network Coding Schemes over Finite and Infinite Fields
: Direct application of network coding at the physical layer - physical layer network coding (PNC) - is a promising technique for two-way relay wireless networks. In a two-way rela...
Shengli Zhang, Soung Chang Liew, Lu Lu