Helmut Jürgensen

Affiliations:
  • University of Western Ontario, Canada


According to our database1, Helmut Jürgensen authored at least 114 papers between 1973 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Automata for solid codes.
Theor. Comput. Sci., 2021

2020
Multisets, heaps, bags, families: What is a multiset?
Math. Struct. Comput. Sci., 2020

2017
Higher-level constructs for families and multisets.
Theor. Comput. Sci., 2017

The Arduous Road of Modelling: Excerpts from Records of an Enjoyable Co-operation of Nearly 20 Years.
Proceedings of the Role of Theory in Computer Science, 2017

2016
Descriptional Complexity of Formal Systems.
Theor. Comput. Sci., 2016

Online Graphics for the Blind: Intermediate Format Generation for Graphic Categories.
Proceedings of the Computers Helping People with Special Needs, 2016

2015
Methods for Relativizing Properties of Codes.
Acta Cybern., 2015

2014
Graph transformation for incremental natural language analysis.
Theor. Comput. Sci., 2014

Preface.
Int. J. Found. Comput. Sci., 2014

Accessibility of E-Commerce Websites for Vision-Impaired Persons.
Proceedings of the Computers Helping People with Special Needs, 2014

Soliton Automata with Multiple Waves.
Proceedings of the Computing with New Resources, 2014

2013
Automata for Codes.
Proceedings of the Implementation and Application of Automata, 2013

Ein Framework für die Erstellung von Simulationen zur Verhaltenstherapie.
Proceedings of the DeLFI 2013, 2013

2012
Relativized codes.
Theor. Comput. Sci., 2012

Invariance and Universality of Complexity.
Proceedings of the Computation, Physics and Beyond, 2012

Peptide Computers.
Proceedings of the Languages Alive, 2012

2011
Setting the table for the blind.
Proceedings of the PETRA 2011, 2011

Incremental Construction of Millstream Configurations Using Graph Transformation.
Proceedings of the Finite-State Methods and Natural Language Processing, 2011

2010
Accessible presentation of information for people with visual disabilities.
Univers. Access Inf. Soc., 2010

Seventy Years Derick Wood.
J. Univers. Comput. Sci., 2010

Derick Wood's Publications.
J. Univers. Comput. Sci., 2010

Entropy and Higher Moments of Information.
J. Univers. Comput. Sci., 2010

Haptic emulation of games: haptic Sudoku for the blind.
Proceedings of the 3rd International Conference on Pervasive Technologies Related to Assistive Environments, 2010

User-Interface Filter for Two-Dimensional Haptic Interaction.
Proceedings of the Computers Helping People with Special Needs, 2010

2009
Topology on words.
Theor. Comput. Sci., 2009

Markers and Deterministic Acceptors for Non-Deterministic Languages.
J. Autom. Lang. Comb., 2009

Homomorphisms Preserving Types of Density.
Acta Cybern., 2009

Random sampling key revocation scheme for distributed sensor networks.
Proceedings of the 2nd International Conference on Pervasive Technologies Related to Assistive Environments, 2009

Communicating through gestures without visual feedback.
Proceedings of the 2nd International Conference on Pervasive Technologies Related to Assistive Environments, 2009

Principial Congruences in Algebras.
Proceedings of the Automata, Formal Languages, and Related Topics, 2009

2008
On the universality of peptide computing.
Nat. Comput., 2008

Complexity, Information, Energy.
Int. J. Found. Comput. Sci., 2008

Synchronization.
Inf. Comput., 2008

Maximum supported network coverage area and cost evaluation of key pre-distribution schemes.
Proceedings of the 1st ACM International Conference on Pervasive Technologies Related to Assistive Environments, 2008

Key Management for Wireless Sensor Networks Using Trusted Neighbors.
Proceedings of the 2008 IEEE/IPIP International Conference on Embedded and Ubiquitous Computing (EUC 2008), 2008

A Dynamical Document Structure to Capture the Semantics of Mathematical Concepts.
Proceedings of the First International Conference on Advances in Computer-Human Interaction, 2008

2007
Finite automata encoding geometric figures.
Theor. Comput. Sci., 2007

Soliton Automata Based on Trees.
Int. J. Found. Comput. Sci., 2007

Representation of Semiautomata by Canonical Words and Equivalences, Part II: Specification of Software Modules.
Int. J. Found. Comput. Sci., 2007

Soliton Languages are Nearly an Anti-AFL.
Int. J. Found. Comput. Sci., 2007

2006
Errata: "representation of Semiautomata by Canonical Words and Equivalences".
Int. J. Found. Comput. Sci., 2006

(Near-)inverses of sequences.
Int. J. Comput. Math., 2006

Peptide Computing - Universality and Theoretical Model.
Proceedings of the Unconventional Computation, 5th International Conference, 2006

2005
Representation of semiautomata by canonical words and equivalences.
Int. J. Found. Comput. Sci., 2005

Is complexity a source of incompleteness?
Adv. Appl. Math., 2005

2004
Asymptotically Optimal Low-Cost Solid Codes.
J. Autom. Lang. Comb., 2004

Editorial.
J. Autom. Lang. Comb., 2004

Synchronization of Communication.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

Pushdown Information.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

2001
Maximal Solid Codes.
J. Autom. Lang. Comb., 2001

Editorial.
J. Autom. Lang. Comb., 2001

Dialogues as Co-Operating Grammars.
J. Autom. Lang. Comb., 2001

Morphisms preserving densities.
Int. J. Comput. Math., 2001

Disjunctivity.
Proceedings of the Words, Semigroups, and Transductions, 2001

2000
Solving Problems with Finite Test Sets.
Proceedings of the Finite Versus Infinite, 2000

1999
Erratum to An Algebra of Multiple Faults in RAMs.
J. Electron. Test., 1999

Syntactic Monoids of Codes.
Acta Cybern., 1999

Finite Automata Encoding Geometric Figures.
Proceedings of the Automata Implementation, 1999

Semilattices of Fault Semiautomata.
Proceedings of the Jewels are Forever, 1999

1998
Built-In Self-Test with an Alternating Output.
Proceedings of the 1998 Design, 1998

1997
Codes<sup>1</sup>.
Proceedings of the Handbook of Formal Languages, Volume 1: Word, Language, Grammar., 1997

Testing for Bounded Faults in RAMs.
J. Electron. Test., 1997

Block-Synchronization Context-Free Grammars.
Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997

1996
Towards Foundations of Cryptographie: Investigation of Perfect Secrecy.
J. Univers. Comput. Sci., 1996

Dependence in Algebras.
Fundam. Informaticae, 1996

An algebra of multiple faults in RAMs.
J. Electron. Test., 1996

1995
Local Hausdorff Dimension.
Acta Informatica, 1995

Error Corrections for Channels with Substitutions, Insertions, and Deletions.
Proceedings of the Information Theory and Applications II, 1995

Variable-Length Codes for Error Correction.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

BIST with negligible aliasing through random cover circuits.
Proceedings of the 1995 Conference on Asia Pacific Design Automation, Makuhari, Massa, Chiba, Japan, August 29, 1995

1994
Transducers and the Decidability of Independence in Free Monoids.
Theor. Comput. Sci., 1994

Design of Cover Circuits for Monitoring the Output of a MISA.
Proceedings of the IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems, 1994

Randomness as an Invariant for Number Representations.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

Algebraic Foundations for Montague Grammars.
Proceedings of the Mathematical Aspects of Natural and Formal Languages, 1994

1993
Deterministic Soliton Automata with at Most One Cycle.
J. Comput. Syst. Sci., 1993

Decidability of the Intercode Property.
J. Inf. Process. Cybern., 1993

The Hierarchy of Codes.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

Monitoring BIST by covers.
Proceedings of the European Design Automation Conference 1993, 1993

1992
Languages Whose n-Element Subsets Are Codes.
Theor. Comput. Sci., 1992

A model for sequential machine testing and diagnosis.
J. Electron. Test., 1992

1991
On alpha-0-nu-1-Products of Automata.
Theor. Comput. Sci., 1991

Deterministic Soliton Automata with a Single Exterior Node.
Theor. Comput. Sci., 1991

Outfix and Infix Codes and Related Classes of Languages.
J. Comput. Syst. Sci., 1991

Relations on free monoids, their independent sets, and codes.
Int. J. Comput. Math., 1991

1990
Automata Represented by Products of Soliton Automata.
Theor. Comput. Sci., 1990

Soliton Automata.
J. Comput. Syst. Sci., 1990

Constructions for alternating finite automata.
Int. J. Comput. Math., 1990

Information transmission in il systems.
Int. J. Comput. Math., 1990

Solid Codes.
J. Inf. Process. Cybern., 1990

1989
Anti-commutative languages and n-codes.
Discret. Appl. Math., 1989

1988
Computerized Braille Typesetting: Another View of Mark-up Standards.
Electron. Publ., 1988

1987
Towards an abstract theory of dependency constraints in relational databases.
Inf. Sci., 1987

1986
Über die Implementierung Redundanzfreier Codes zur Datenverschlüsselung.
RAIRO Theor. Informatics Appl., 1986

Which Monoids are Syntactic Monoids of omega-Languages?
J. Inf. Process. Cybern., 1986

Design of a secure relational data base.
Comput. Secur., 1986

1985
Syntactic monoids in the construction of systolic tree automata.
Int. J. Parallel Program., 1985

1984
A note on the Arimoto-Blahut algorithm for computing the capacity of discrete memoryless channels.
IEEE Trans. Inf. Theory, 1984

Charakterisierung Redundanzfreier Codes zur Datenverschlüsselung.
RAIRO Theor. Informatics Appl., 1984

Komplexität von Erzeugen in Algebren.
Acta Cybern., 1984

1983
On<i>ω</i>-Languages whose syntactic monoid is trivial.
Int. J. Parallel Program., 1983

Disjunctive omega-Languages.
J. Inf. Process. Cybern., 1983

Language Redundancy and the Unicity Point.
Cryptologia, 1983

Some Results on the Information Theoretic Analysis of Cryptosystems.
Proceedings of the Advances in Cryptology, 1983

1982
Self-regulating L Systems.
J. Inf. Process. Cybern., 1982

1981
Life and Death in Markov Deterministic Tabled OL Systems
Inf. Control., January, 1981

Cut point languages of markov DTOL systems.
Int. J. Parallel Program., 1981

1979
Degradated observability for stochastic automata.
Kybernetika, 1979

Transformationendarstellungen endlicher abstrakt präsentierter Halbgruppen.
Computing, 1979

1978
Über das Rechnen mit den Elementen abstrakt präsentierter Halbgruppen.
Acta Cybern., 1978

1975
Einige Eigenschaften der Monoide von Akzeptoren und Ereignissen.
J. Inf. Process. Cybern., 1975

Probabilistic L Systems.
Proceedings of the Automata, Languages, Development: At the crossroads of biology, mathematics and computer science, result of an international conference held at Noordwijkerhout, The Netherlands, March 31, 1975

1974
Zur Übersetzbarkeit von Programmiersprachen.
Proceedings of the 3. Fachtagung über Programmiersprachen, 1974

1973
Bestimmung der Unterhalbgruppenverbände für zwei Klassen endlicher Halbgruppen.
Computing, 1973

On the computation of union-extensions of finite semigroups.
Acta Cybern., 1973


  Loading...