Sciweavers

119 search results - page 8 / 24
» On finite alphabets and infinite bases
Sort
View
ICMS
2010
13 years 7 months ago
Computing Polycyclic Quotients of Finitely (L-)Presented Groups via Groebner Bases
We announce the development and implementation of a new GAP package PCQL. This facilitates the computation of consistent polycyclic presentations for polycyclic quotients of groups...
Bettina Eick, Max Horn
SLOGICA
2008
126views more  SLOGICA 2008»
13 years 9 months ago
On the Proof Theory of the Modal mu-Calculus
We study the proof-theoretic relationship between two deductive systems for the modal mu-calculus. First we recall an infinitary system which contains an omega rule allowing to de...
Thomas Studer
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 10 months ago
A finiteness structure on resource terms
In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinati...
Thomas Ehrhard
AWPN
2008
232views Algorithms» more  AWPN 2008»
13 years 11 months ago
Synthesis of Petri Nets from Infinite Partial Languages with VipTool
Abstract. In this paper we show an implementation of an algorithm to synthesize a place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by ...
Robin Bergenthum, Sebastian Mauser
TSP
2008
123views more  TSP 2008»
13 years 9 months ago
Blind and Semiblind Channel and Carrier Frequency-Offset Estimation in Orthogonally Space-Time Block Coded MIMO Systems
In this paper, the problem of joint channel and carrier frequency offset (CFO) estimation is studied in the context of multiple-input multiple-output (MIMO) communications based on...
Shahram Shahbazpanahi, Alex B. Gershman, Georgios ...