On the computation of union-extensions of finite semigroups. - R. Bröck; Helmut Jürgensen (Acta Cybern., 1973)

Bestimmung der Unterhalbgruppenverbände für zwei Klassen endlicher Halbgruppen. - Helmut Jürgensen; Peter Wick (Computing, 1973)

Zur Übersetzbarkeit von Programmiersprachen. - Helmut Jürgensen (Fachtagung über Programmiersprachen, 1974)

Probabilistic L Systems. - Helmut Jürgensen (Automata, Languages, Development, 1975)

Einige Eigenschaften der Monoide von Akzeptoren und Ereignissen. - Helmut Jürgensen (J. Inf. Process. Cybern., 1975)

Über das Rechnen mit den Elementen abstrakt präsentierter Halbgruppen. - Helmut Jürgensen (Acta Cybern., 1978)

Transformationendarstellungen endlicher abstrakt präsentierter Halbgruppen. - Helmut Jürgensen (Computing, 1979)

Degradated observability for stochastic automata. - Helmut Jürgensen; H.-D. Tikovsky (Kybernetika, 1979)

Cut point languages of markov DTOL systems. - Helmut Jürgensen; David E. Matthews 002; Derick Wood (Int. J. Parallel Program., 1981)

Life and Death in Markov Deterministic Tabled OL Systems - Helmut Jürgensen; David E. Matthews 002; Derick Wood (Inf. Control., 1981)

Self-regulating L Systems. - Helmut Jürgensen; Derick Wood (J. Inf. Process. Cybern., 1982)

Some Results on the Information Theoretic Analysis of Cryptosystems. - Helmut Jürgensen; D. E. Matthew (CRYPTO, 1983)

Language Redundancy and the Unicity Point. - Helmut Jürgensen (Cryptologia, 1983)

Disjunctive omega-Languages. - Helmut Jürgensen; Huei-Jan Shyr; Gabriel Thierrin (J. Inf. Process. Cybern., 1983)

Onω-Languages whose syntactic monoid is trivial. - Helmut Jürgensen; Gabriel Thierrin (Int. J. Parallel Program., 1983)

Komplexität von Erzeugen in Algebren. - Helmut Jürgensen (Acta Cybern., 1984)

Charakterisierung Redundanzfreier Codes zur Datenverschlüsselung. - Helmut Jürgensen; M. Kunze (RAIRO Theor. Informatics Appl., 1984)

A note on the Arimoto-Blahut algorithm for computing the capacity of discrete memoryless channels. - Helmut Jürgensen (IEEE Trans. Inf. Theory, 1984)

Syntactic monoids in the construction of systolic tree automata. - Helmut Jürgensen; Arto Salomaa (Int. J. Parallel Program., 1985)

Design of a secure relational data base. - John M. Carroll 002; Helmut Jürgensen (Comput. Secur., 1986)

Which Monoids are Syntactic Monoids of omega-Languages? - Helmut Jürgensen; Gabriel Thierrin (J. Inf. Process. Cybern., 1986)

Über die Implementierung Redundanzfreier Codes zur Datenverschlüsselung. - Helmut Jürgensen; M. Kunze (RAIRO Theor. Informatics Appl., 1986)

Towards an abstract theory of dependency constraints in relational databases. - Helmut Jürgensen; Dan A. Simovici (Inf. Sci., 1987)

Computerized Braille Typesetting: Another View of Mark-up Standards. - R. Arrabito; Helmut Jürgensen (Electron. Publ., 1988)

Anti-commutative languages and n-codes. - Masami Ito; Helmut Jürgensen; Huei-Jan Shyr; Gabriel Thierrin (Discret. Appl. Math., 1989)

Solid Codes. - Helmut Jürgensen; S. S. Yu (J. Inf. Process. Cybern., 1990)

Information transmission in il systems. - Jürgen Dassow; Helmut Jürgensen; Wolfgang Rülling (Int. J. Comput. Math., 1990)

Constructions for alternating finite automata. - Abdelaziz Fellah; Helmut Jürgensen; Sheng Yu 001 (Int. J. Comput. Math., 1990)

Soliton Automata. - Jürgen Dassow; Helmut Jürgensen (J. Comput. Syst. Sci., 1990)

Automata Represented by Products of Soliton Automata. - Ferenc Gécseg; Helmut Jürgensen (Theor. Comput. Sci., 1990)

Relations on free monoids, their independent sets, and codes. - Helmut Jürgensen; S. S. Yu (Int. J. Comput. Math., 1991)

Outfix and Infix Codes and Related Classes of Languages. - Masami Ito; Helmut Jürgensen; Huei-Jan Shyr; Gabriel Thierrin (J. Comput. Syst. Sci., 1991)

Deterministic Soliton Automata with a Single Exterior Node. - Jürgen Dassow; Helmut Jürgensen (Theor. Comput. Sci., 1991)

On alpha-0-nu-1-Products of Automata. - Ferenc Gécseg; Helmut Jürgensen (Theor. Comput. Sci., 1991)

A model for sequential machine testing and diagnosis. - Janusz A. Brzozowski; Helmut Jürgensen (J. Electron. Test., 1992)

Languages Whose n-Element Subsets Are Codes. - Masami Ito; Helmut Jürgensen; Huei-Jan Shyr; Gabriel Thierrin (Theor. Comput. Sci., 1992)

Monitoring BIST by covers. - Michael Gössel; Helmut Jürgensen (EURO-DAC, 1993)

The Hierarchy of Codes. - Helmut Jürgensen; Stavros Konstantinidis (FCT, 1993)

Decidability of the Intercode Property. - Helmut Jürgensen; Kai Salomaa; Sheng Yu 001 (J. Inf. Process. Cybern., 1993)

Deterministic Soliton Automata with at Most One Cycle. - Jürgen Dassow; Helmut Jürgensen (J. Comput. Syst. Sci., 1993)

Algebraic Foundations for Montague Grammars. - Helmut Jürgensen; Katrin Tent (Mathematical Aspects of Natural and Formal Languages, 1994)

Randomness as an Invariant for Number Representations. - Cristian Calude; Helmut Jürgensen (Results and Trends in Theoretical Computer Science, 1994)

Design of Cover Circuits for Monitoring the Output of a MISA. - T. Bogue; Helmut Jürgensen; Michael Gössel (DFT, 1994)

Transducers and the Decidability of Independence in Free Monoids. - Helmut Jürgensen; Kai Salomaa; Sheng Yu 001 (Theor. Comput. Sci., 1994)

BIST with negligible aliasing through random cover circuits. - T. Bogue; Helmut Jürgensen; Michael Gössel (ASP-DAC, 1995)

Variable-Length Codes for Error Correction. - Helmut Jürgensen; Stavros Konstantinidis (ICALP, 1995)

Error Corrections for Channels with Substitutions, Insertions, and Deletions. - Helmut Jürgensen; Stavros Konstantinidis (Information Theory and Applications, 1995)

Local Hausdorff Dimension. - Helmut Jürgensen; Ludwig Staiger (Acta Informatica, 1995)

An algebra of multiple faults in RAMs. - Janusz A. Brzozowski; Helmut Jürgensen (J. Electron. Test., 1996)

Dependence in Algebras. - Ferenc Gécseg; Helmut Jürgensen (Fundam. Informaticae, 1996)

Towards Foundations of Cryptographie: Investigation of Perfect Secrecy. - Helmut Jürgensen; Lynda E. Robbins (J. Univers. Comput. Sci., 1996)

Block-Synchronization Context-Free Grammars. - Helmut Jürgensen; Kai Salomaa (Advances in Algorithms, Languages, and Complexity, 1997)

Testing for Bounded Faults in RAMs. - René David; Janusz A. Brzozowski; Helmut Jürgensen (J. Electron. Test., 1997)

Codes1. - Helmut Jürgensen; Stavros Konstantinidis (Handbook of Formal Languages (1), 1997)

Built-In Self-Test with an Alternating Output. - T. Bogue; Michael Gössel; Helmut Jürgensen; Yervant Zorian (DATE, 1998)

Semilattices of Fault Semiautomata. - Janusz A. Brzozowski; Helmut Jürgensen (Jewels are Forever, 1999)

Finite Automata Encoding Geometric Figures. - Helmut Jürgensen; Ludwig Staiger (WIA, 1999)

Syntactic Monoids of Codes. - Helmut Jürgensen (Acta Cybern., 1999)

Erratum to An Algebra of Multiple Faults in RAMs. - Janusz A. Brzozowski; Helmut Jürgensen (J. Electron. Test., 1999)

Solving Problems with Finite Test Sets. - Cristian S. Calude; Helmut Jürgensen; Shane Legg (Finite Versus Infinite, 2000)

Disjunctivity. - Helmut Jürgensen (Words, Semigroups, and Transductions, 2001)

Morphisms preserving densities. - Helmut Jürgensen; Lila Kari; Gabriel Thierrin (Int. J. Comput. Math., 2001)

Dialogues as Co-Operating Grammars. - Suna Aydin; Helmut Jürgensen; Lynda E. Robbins (J. Autom. Lang. Comb., 2001)

Editorial. - Helmut Jürgensen (J. Autom. Lang. Comb., 2001)

Maximal Solid Codes. - Helmut Jürgensen; Masashi Katsura; Stavros Konstantinidis (J. Autom. Lang. Comb., 2001)

Talking Tactile Diagrams. - Mark G. Eramian; Helmut Jürgensen; Haibo Li; Christopher Power (HCI (4), 2003)

Pushdown Information. - Henning Bordihn; Helmut Jürgensen (DCFS, 2004)

Synchronization of Communication. - Helmut Jürgensen (DCFS, 2004)

Editorial. - Jürgen Dassow; Helmut Jürgensen; Detlef Wotschke (J. Autom. Lang. Comb., 2004)

Asymptotically Optimal Low-Cost Solid Codes. - Helmut Jürgensen; Stavros Konstantinidis; Nguyen Huong Lam (J. Autom. Lang. Comb., 2004)

Is complexity a source of incompleteness? - Cristian S. Calude; Helmut Jürgensen (Adv. Appl. Math., 2005)

Representation of semiautomata by canonical words and equivalences. - Janusz A. Brzozowski; Helmut Jürgensen (Int. J. Found. Comput. Sci., 2005)

Peptide Computing - Universality and Theoretical Model. - M. Sakthi Balan; Helmut Jürgensen (UC, 2006)

(Near-)inverses of sequences. - Helmut Jürgensen; Stavros Konstantinidis (Int. J. Comput. Math., 2006)

Errata: "representation of Semiautomata by Canonical Words and Equivalences". - Janusz A. Brzozowski; Helmut Jürgensen (Int. J. Found. Comput. Sci., 2006)

Soliton Languages are Nearly an Anti-AFL. - Oliver Boldt; Helmut Jürgensen (Int. J. Found. Comput. Sci., 2007)

Representation of Semiautomata by Canonical Words and Equivalences, Part II: Specification of Software Modules. - Janusz A. Brzozowski; Helmut Jürgensen (Int. J. Found. Comput. Sci., 2007)

Soliton Automata Based on Trees. - Helmut Jürgensen; Pauline Kraak (Int. J. Found. Comput. Sci., 2007)

Finite automata encoding geometric figures. - Helmut Jürgensen; Ludwig Staiger; Hideki Yamasaki (Theor. Comput. Sci., 2007)

A Dynamical Document Structure to Capture the Semantics of Mathematical Concepts. - Jackson Marques de Carvalho; Helmut Jürgensen (ACHI, 2008)

Key Management for Wireless Sensor Networks Using Trusted Neighbors. - Yuan Xue; Helmut Jürgensen; Reza Azarderakhsh; Arash Reyhani-Masoleh (EUC (2), 2008)

Maximum supported network coverage area and cost evaluation of key pre-distribution schemes. - Yuan Xue; Helmut Jürgensen (PETRA, 2008)

Synchronization. - Helmut Jürgensen (Inf. Comput., 2008)

Complexity, Information, Energy. - Helmut Jürgensen (Int. J. Found. Comput. Sci., 2008)

On the universality of peptide computing. - M. Sakthi Balan; Helmut Jürgensen (Nat. Comput., 2008)

Principial Congruences in Algebras. - Helmut Jürgensen (Automata, Formal Languages, and Related Topics, 2009)

Communicating through gestures without visual feedback. - Irene Sturm; Maria Schiewe; Wiebke Köhlmann; Helmut Jürgensen (PETRA, 2009)

Random sampling key revocation scheme for distributed sensor networks. - Yuan Xue; Helmut Jürgensen (PETRA, 2009)

Homomorphisms Preserving Types of Density. - Helmut Jürgensen; Ian McQuillan (Acta Cybern., 2009)

Markers and Deterministic Acceptors for Non-Deterministic Languages. - Helmut Jürgensen (J. Autom. Lang. Comb., 2009)

Topology on words. - Cristian S. Calude; Helmut Jürgensen; Ludwig Staiger (Theor. Comput. Sci., 2009)

User-Interface Filter for Two-Dimensional Haptic Interaction. - Wiebke Köhlmann; Francis Zinke; Maria Schiewe; Helmut Jürgensen (ICCHP (2), 2010)

Haptic emulation of games: haptic Sudoku for the blind. - René Gutschmidt; Maria Schiewe; Francis Zinke; Helmut Jürgensen (PETRA, 2010)

Entropy and Higher Moments of Information. - Helmut Jürgensen; David E. Matthews 002 (J. Univers. Comput. Sci., 2010)

Derick Wood's Publications. - Helmut Jürgensen (J. Univers. Comput. Sci., 2010)

Seventy Years Derick Wood. - Helmut Jürgensen; Hermann A. Maurer; Arto Salomaa; Sheng Yu 001 (J. Univers. Comput. Sci., 2010)

Accessible presentation of information for people with visual disabilities. - Christopher Power; Helmut Jürgensen (Univers. Access Inf. Soc., 2010)

Incremental Construction of Millstream Configurations Using Graph Transformation. - Suna Bensch; Frank Drewes; Helmut Jürgensen; Brink van der Merwe (FSMNLP, 2011)

Setting the table for the blind. - Mechmet Chiousemoglou; Helmut Jürgensen (PETRA, 2011)

Peptide Computers. - M. Sakthi Balan; Helmut Jürgensen (Languages Alive, 2012)

Invariance and Universality of Complexity. - Helmut Jürgensen (Computation, Physics and Beyond, 2012)

Relativized codes. - Mark Daley; Helmut Jürgensen; Lila Kari; Kalpana Mahalingam (Theor. Comput. Sci., 2012)

Ein Framework für die Erstellung von Simulationen zur Verhaltenstherapie. - René Gutschmidt; Helmut Jürgensen; Ulrike Lucke (DeLFI, 2013)

Automata for Codes. - Helmut Jürgensen (CIAA, 2013)

Soliton Automata with Multiple Waves. - Henning Bordihn; Helmut Jürgensen; Heiko Ritter (Computing with New Resources, 2014)

Accessibility of E-Commerce Websites for Vision-Impaired Persons. - Roopa Bose; Helmut Jürgensen (ICCHP (1), 2014)

Preface. - Helmut Jürgensen; Rogério Reis (Int. J. Found. Comput. Sci., 2014)

Graph transformation for incremental natural language analysis. - Suna Bensch; Frank Drewes; Helmut Jürgensen; Brink van der Merwe (Theor. Comput. Sci., 2014)

Methods for Relativizing Properties of Codes. - Helmut Jürgensen; Lila Kari; Steffen Kopecki (Acta Cybern., 2015)

Online Graphics for the Blind: Intermediate Format Generation for Graphic Categories. - Roopa Bose; Helmut Jürgensen (ICCHP (1), 2016)

Descriptional Complexity of Formal Systems. - Helmut Jürgensen; Juhani Karhumäki; Alexander Okhotin (Theor. Comput. Sci., 2016)

The Arduous Road of Modelling: Excerpts from Records of an Enjoyable Co-operation of Nearly 20 Years. - Helmut Jürgensen (The Role of Theory in Computer Science, 2017)

Higher-level constructs for families and multisets. - Helmut Jürgensen (Theor. Comput. Sci., 2017)

Multisets, heaps, bags, families: What is a multiset? - Helmut Jürgensen (Math. Struct. Comput. Sci., 2020)

Automata for solid codes. - Helmut Jürgensen; Ludwig Staiger (Theor. Comput. Sci., 2021)

Multi-Wave Soliton Automata. - Henning Bordihn; Helmut Jürgensen (J. Autom. Lang. Comb., 2022)