TY  - JOUR
A1  - Bogue, Ted
A1  - Gössel, Michael
A1  - Jürgensen, Helmut
A1  - Zorian, Yervant
T1  - Built-in self-Test with an alternating output
Y1  - 1998
SN  - 0-8186-8359-7
ER  - 
TY  - JOUR
A1  - Bogue, Ted
A1  - Jürgensen, Helmut
A1  - Gössel, Michael
T1  - BIST with negligible aliasing through random cover circuits
Y1  - 1995
ER  - 
TY  - JOUR
A1  - Bogue, Ted
A1  - Jürgensen, Helmut
A1  - Gössel, Michael
T1  - Design of cover circuits for monitoring the output of a MISR
Y1  - 1994
SN  - 0-8186-6307-3 , 0-8186-6306-5
ER  - 
TY  - BOOK
A1  - de Carvalho, Jackson Marques
A1  - Jürgensen, Helmut
T1  - Document authoring environments and authoring mathematics
T3  - Preprint / Universität Potsdam, Institut für Informatik
Y1  - 2008
SN  - 0946-7580
VL  - 2008, 1
PB  - Univ.
CY  - Potsdam
ER  - 
TY  - GEN
A1  - Marques de Carvalho, Jackson W.
A1  - Jürgensen, Helmut
T1  - Flexible Structured Mathematics Notation : IADIS, International Conference Interfaces and Human Computer Interaction, Lisabon, 2007
T2  - Preprint / Universität Potsdam, Institut für Informatik
Y1  - 2007
SN  - 0946-7580
VL  - 2007, 1
PB  - Univ.
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Brzozowski, J. A.
A1  - Jürgensen, Helmut
T1  - Representation of semiautomata by canonical words and equivalences
N2  - 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
Y1  - 2005
SN  - 0129-0541
ER  - 
TY  - BOOK
A1  - Bensch, Suna
A1  - Boldt, Oliver
A1  - Bordihn, Henning
A1  - Jürgensen, Helmut
T1  - Workshop "Formale Methoden der Linguistik" und "14. Theorietag Automaten und Formale Sprachen"
T3  - Preprint / Universität Potsdam, Institut für Informatik
Y1  - 2004
SN  - 0946-7580
VL  - 2004, 2
PB  - Univ.
CY  - Potsdam
ER  - 
TY  - BOOK
A1  - Jürgensen, Helmut
T1  - Complexity, information, energy
T3  - Preprint / Universität Potsdam, Institut für Informatik
Y1  - 2006
SN  - 0946-7580
VL  - 2006, 6
PB  - Univ.
CY  - Potsdam
ER  - 
TY  - BOOK
A1  - Balan, Sakthin M.
A1  - Jürgensen, Helmut
T1  - Peptide computing : universality and theoretical model
T3  - Preprint / Universität Potsdam, Institut für Informatik
Y1  - 2006
SN  - 0946-7580
VL  - 2006, 1
PB  - Univ.
CY  - Potsdam
ER  - 
TY  - BOOK
A1  - Balan, Sakthin M.
A1  - Jürgensen, Helmut
T1  - On the universality of peptide computing
T3  - Preprint / Universität Potsdam, Institut für Informatik
Y1  - 2006
SN  - 0946-7580
VL  - 2006, 9
PB  - Univ.
CY  - Potsdam
ER  -