The following pages link to Helmut Jürgensen (Q418758):
Displaying 50 items.
- Relativized codes (Q418759) (← links)
- (Q690113) (redirect page) (← links)
- Algebras with dimension (Q690115) (← links)
- Deterministic soliton automata with a single exterior node (Q811132) (← links)
- Soliton automata (Q909470) (← links)
- Automata represented by products of soliton automata (Q914406) (← links)
- On the universality of peptide computing (Q926519) (← links)
- Synchronization (Q948067) (← links)
- Finite automata encoding geometric figures (Q995557) (← links)
- Topology on words (Q1019711) (← links)
- Inference algorithms for developmental systems with cell lineages (Q1090280) (← links)
- Monoids with disjunctive identity and their codes (Q1091482) (← links)
- Towards an abstract theory of dependency constraints in relational databases (Q1097050) (← links)
- Semigroups with each element disjunctive (Q1149523) (← links)
- Ein Fast-Jordan-Hölder-Satz für Fastideale (Q1161829) (← links)
- Languages whose \(n\)-element subsets are codes (Q1184989) (← links)
- Outfix and infix codes and related classes of languages (Q1186552) (← links)
- Fastideale von Halbgruppen (Q1211595) (← links)
- Vereinigungserweiterungen durch vollständig 0-einfache Halbgruppen (Q1228836) (← links)
- Die Halbgruppen der Ordnungen \(\leq 7\) (Q1240317) (← links)
- Computers in semigroups (Q1244386) (← links)
- Transformationendarstellungen endlicher abstrakt präsentierter Halbgruppen (Q1257103) (← links)
- Transducers and the decidability of independence in free monoids (Q1341744) (← links)
- Is independence an exception? (Q1805264) (← links)
- On \(\alpha{}_ 0-\nu{}_ 1\)-products of automata (Q1814100) (← links)
- Anti-commutative languages and n-codes (Q1823000) (← links)
- Randomness on full shift spaces (Q1868530) (← links)
- Local Hausdorff dimension (Q1899101) (← links)
- Automata for solid codes (Q2235761) (← links)
- Higher-level constructs for families and multisets (Q2358687) (← links)
- Deterministic soliton automata with at most one cycle (Q2366276) (← links)
- Is complexity a source of incompleteness? (Q2386137) (← links)
- Graph transformation for incremental natural language analysis (Q2441777) (← links)
- Bestimmung der Unterhalbgruppenverbände für zwei Klassen endlicher Halbgruppen (Q2562410) (← links)
- (Q2708467) (← links)
- Methods for Relativizing Properties of Codes (Q2803046) (← links)
- Invariance and Universality of Complexity (Q2891308) (← links)
- Soliton Automata with Multiple Waves (Q2944877) (← links)
- REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES, PART II: SPECIFICATION OF SOFTWARE MODULES (Q3065617) (← links)
- (Q3141326) (← links)
- Peptide Computers (Q3166940) (← links)
- Information transmission in il systems<sup>∗</sup> (Q3210898) (← links)
- Programmable finite automata for VLSI† (Q3309068) (← links)
- (Q3318119) (← links)
- The multiway trees of hanoi<sup>†</sup> (Q3335009) (← links)
- On?-Languages whose syntactic monoid is trivial (Q3335014) (← links)
- (Q3335015) (← links)
- (Q3342765) (← links)
- A note on the Arimoto- Blahut algorithm for computing the capacity of discrete memoryless channels (Corresp.) (Q3343908) (← links)
- (Q3344380) (← links)
