@article{BogueGoesselJuergensenetal.1998,
  author    = {Bogue, Ted and G{\"o}ssel, Michael and J{\"u}rgensen, Helmut and Zorian, Yervant},
  title     = {Built-in self-Test with an alternating output},
  isbn      = {0-8186-8359-7},
  year      = {1998},
  language  = {en}
}
@article{BogueJuergensenGoessel1995,
  author    = {Bogue, Ted and J{\"u}rgensen, Helmut and G{\"o}ssel, Michael},
  title     = {BIST with negligible aliasing through random cover circuits},
  year      = {1995},
  language  = {en}
}
@article{BogueJuergensenGoessel1994,
  author    = {Bogue, Ted and J{\"u}rgensen, Helmut and G{\"o}ssel, Michael},
  title     = {Design of cover circuits for monitoring the output of a MISR},
  isbn      = {0-8186-6307-3 , 0-8186-6306-5},
  year      = {1994},
  language  = {en}
}
@book{deCarvalhoJuergensen2008,
  author    = {de Carvalho, Jackson Marques and J{\"u}rgensen, Helmut},
  title     = {Document authoring environments and authoring mathematics},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2008, 1},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {8 S.},
  year      = {2008},
  language  = {en}
}
@misc{MarquesdeCarvalhoJuergensen2007,
  author    = {Marques de Carvalho, Jackson W. and J{\"u}rgensen, Helmut},
  title     = {Flexible Structured Mathematics Notation : IADIS, International Conference Interfaces and Human Computer Interaction, Lisabon, 2007},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2007, 1},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {5 S.},
  year      = {2007},
  language  = {en}
}
@article{BrzozowskiJuergensen2005,
  author    = {Brzozowski, J. A. and J{\"u}rgensen, Helmut},
  title     = {Representation of semiautomata by canonical words and equivalences},
  issn      = {0129-0541},
  year      = {2005},
  abstract  = {We study a novel representation of semiautomata, which is motivated by the method of trace-assertion specifications of software modules. Each state of the semiautomaton is represented by an arbitrary word leading to that state, the canonical word. The transitions of the semiautomaton give rise to a right congruence, the state-equivalence, on the set of input words of the semiautomaton: two words are state-equivalent if and only if they lead to the same state. We present a simple algorithm for finding a set of generators for state-equivalence. Directly from this set of generators, we construct a confluent prefix-rewriting system which permits us to transform any word to its canonical representative. In general, the rewriting system may allow infinite derivations. To address this issue, we impose the condition of prefix-continuity on the set of canonical words. A set is prefix-continuous if, whenever a word w and a prefix u of w axe in the set, then all the prefixes of w longer than u are also in the set. Prefix-continuous sets include prefix-free and prefix-closed sets as special cases. We prove that the rewriting system is Noetherian if and only if the set of canonical words is prefix-continuous. Furthermore, if the set of canonical words is prefix- continuous, then the set of rewriting rules is irredundant. We show that each prefix-continuous canonical set corresponds to a spanning forest of the semiautomaton},
  language  = {en}
}
@book{BenschBoldtBordihnetal.2004,
  author    = {Bensch, Suna and Boldt, Oliver and Bordihn, Henning and J{\"u}rgensen, Helmut},
  title     = {Workshop "Formale Methoden der Linguistik" und "14. Theorietag Automaten und Formale Sprachen"},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2004, 2},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {144 S.},
  year      = {2004},
  language  = {de}
}
@book{Juergensen2006,
  author    = {J{\"u}rgensen, Helmut},
  title     = {Complexity, information, energy},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2006, 6},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {5 S.},
  year      = {2006},
  language  = {en}
}
@book{BalanJuergensen2006,
  author    = {Balan, Sakthin M. and J{\"u}rgensen, Helmut},
  title     = {Peptide computing : universality and theoretical model},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2006, 1},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {15 S.},
  year      = {2006},
  language  = {en}
}
@book{BalanJuergensen2006,
  author    = {Balan, Sakthin M. and J{\"u}rgensen, Helmut},
  title     = {On the universality of peptide computing},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2006, 9},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {ca. 23 S.},
  year      = {2006},
  language  = {en}
}