@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{CaludeJurgensen2005,
  author    = {Calude, C. S. and Jurgensen, Helmut},
  title     = {Is complexity a source of incompleteness?},
  issn      = {0196-8858},
  year      = {2005},
  abstract  = {In this paper we prove Chaitin's "heuristic principle," the theorems of a finitely-specified theory cannot be significantly more complex than the theory itself, for an appropriate measure of complexity. We show that the measure is invariant under the change of the Godel numbering. For this measure, the theorems of a finitely-specified, sound, consistent theory strong enough to formalize arithmetic which is arithmetically sound (like Zermelo-Fraenkel set theory with choice or Peano Arithmetic) have bounded complexity, hence every sentence of the theory which is significantly more complex than the theory is unprovable. Previous results showing that incompleteness is not accidental, but ubiquitous are here reinforced in probabilistic terms: the probability that a true sentence of length n is provable in the theory tends to zero when n tends to infinity, while the probability that a sentence of length n is true is strictly positive. (c) 2004 Elsevier Inc. All rights reserved},
  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}
}
@book{Juergensen2006,
  author    = {J{\"u}rgensen, Helmut},
  title     = {Synchronization},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2006, 5},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {21 S.},
  year      = {2006},
  language  = {en}
}
@book{Juergensen1998,
  author    = {J{\"u}rgensen, Helmut},
  title     = {Towards computer science},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {1998, 03},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {10 Bl. : Ill.},
  year      = {1998},
  language  = {en}
}
@book{MarquesdeCarvalhoJuergensen1998,
  author    = {Marques de Carvalho, Jackson W. and J{\"u}rgensen, Helmut},
  title     = {Dynamic multi-purpose mathematics notation},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {1998, 04},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {14 Bl. : graph. Darst.},
  year      = {1998},
  language  = {en}
}
@article{JuergensenKonstantinidis2006,
  author    = {J{\"u}rgensen, Helmut and Konstantinidis, Stavros},
  title     = {(Near-)inverses of sequences},
  issn      = {0020-7160},
  doi       = {10.1080/00207160500537801},
  year      = {2006},
  abstract  = {We introduce the notion of a near-inverse of a non-decreasing sequence of positive integers; near-inverses are intended to assume the role of inverses in cases when the latter cannot exist. We prove that the near-inverse of such a sequence is unique; moreover, the relation of being near-inverses of each other is symmetric, i.e. if sequence g is the near-inverse of sequence f, then f is the near-inverse of g. There is a connection, by approximations, between near- inverses of sequences and inverses of continuous strictly increasing real-valued functions which can be exploited to derive simple expressions for near-inverses},
  language  = {en}
}
@book{AydinJuergensenRobbins2001,
  author    = {Aydin, Suna and J{\"u}rgensen, Helmut and Robbins, L. E.},
  title     = {Dialogues as co-operating grammars},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2001, 1},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {16 S.},
  year      = {2001},
  language  = {en}
}
@book{JuergensenStaiger1999,
  author    = {J{\"u}rgensen, Helmut and Staiger, Ludwig},
  title     = {Finite automata : encoding geometric figures},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {1999, 07},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {8 S. : graph. Darst.},
  year      = {1999},
  language  = {en}
}
@book{JuergensenKariThierrin1999,
  author    = {J{\"u}rgensen, Helmut and Kari, L. and Thierrin, G.},
  title     = {Morphisms preserving densities},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {1999, 09},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {21 Bl.},
  year      = {1999},
  language  = {en}
}
@book{JuergensenKatsuraKonstantinidis1999,
  author    = {J{\"u}rgensen, Helmut and Katsura, M. and Konstantinidis, Stavros},
  title     = {Maximal solid codes},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {1999, 03},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {23 Bl.},
  year      = {1999},
  language  = {en}
}
@book{BrzozowskiJuergensen1999,
  author    = {Brzozowski, J. A. and J{\"u}rgensen, Helmut},
  title     = {Semilattices of fault semiautomata},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {1999, 02},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {13 Bl.},
  year      = {1999},
  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}
}
@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{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}
}