Differences between revisions 3 and 5 (spanning 2 versions)
Revision 3 as of 2005-02-07 20:02:16
Size: 328
Editor: yakko
Comment:
Revision 5 as of 2006-10-11 19:31:03
Size: 1290
Editor: fw
Comment:
Deletions are marked like this. Additions are marked like this.
Line 5: Line 5:
Make changes to: attachment:SemiLinearSets.tex The old tex file is attached here: attachment:SemiLinearSets.tex
Line 7: Line 7:
{{{#!latex2
Let $N$ be the set of nonnegative integers and $k$ be a positive
integer. A set $S\subseteq N^{k}$ is a \emph{linear set} if
$\exists v_{0},v_{1},...,v_{t}$ in $N^{k}$ such that
\[
    S=\left\{ v|v=v_{0}+a_{1}v_{1}+...+a_{t}v_{t},a_{i}\in N\right\}
\]
The vector $v_{0}$ (referred to as the \emph{constant vector}) and
$v_{1},v_{2},...,v_{t}$ (referred to as the \emph{periods}) are called the
\emph{generators} of the linear set $S$.
\bigskip
Line 8: Line 19:
A set $S\subseteq N^{k}$ is \emph{semilinear} if it is a finite
union of linear sets. $\emptyset $ is a trivial semilinear set where the set
of generators is empty. \emph{Every finite subset of }$N^{k}$\emph{
\ is semilinear} - it is a finite union of linear sets whose generators are
constant vectors. Clearly, \emph{semilinear} sets are closed under union and
projection. It is also know that semilinear sets are closed under
intersection and complementation.
}}}

SemiLinearSets

See the definition for linear and semilinear sets in the following: attachment:SemiLinearSets.pdf

The old tex file is attached here: attachment:SemiLinearSets.tex

Let $N$ be the set of nonnegative integers and $k$ be a positive
integer. A set $S\subseteq N^{k}$ is a \emph{linear set} if 
$\exists v_{0},v_{1},...,v_{t}$ in $N^{k}$ such that
\[
    S=\left\{ v|v=v_{0}+a_{1}v_{1}+...+a_{t}v_{t},a_{i}\in N\right\}
\]
The vector $v_{0}$ (referred to as the \emph{constant vector}) and 
$v_{1},v_{2},...,v_{t}$ (referred to as the \emph{periods}) are called the
\emph{generators} of the linear set $S$.
\bigskip

A set $S\subseteq N^{k}$ is \emph{semilinear} if it is a finite
union of linear sets. $\emptyset $ is a trivial semilinear set where the set
of generators is empty. \emph{Every finite subset of }$N^{k}$\emph{
\ is semilinear} - it is a finite union of linear sets whose generators are
constant vectors. Clearly, \emph{semilinear} sets are closed under union and
projection. It is also know that semilinear sets are closed under
intersection and complementation.

The previous definition is from: [http://www.eecs.wsu.edu/~zdang/papers/catalytic.pdf Catalytic P Systems, Semilinear Sets, and Vector Addition Systems]

SemiLinearSets (last edited 2020-01-26 21:07:54 by scot)