Arto Salomaa

From MaRDI portal
Person:235701

Available identifiers

zbMath Open salomaa.arto-kWikidataQ578300 ScholiaQ578300MaRDI QIDQ235701

List of research outcomes

PublicationDate of PublicationType
Volume Edited by Magnus Steinby2024-02-16Paper
Parikh Matrices: Subword Indicators and Degrees of Ambiguity2023-06-30Paper
ITERATED MORPHISMS WITH COMPLEMENTARITY ON THE DNA ALPHABET2022-12-06Paper
Algebraic Systems and Pushdown Automata2022-04-28Paper
On Bases of Many-Valued Truth Functions2019-07-04Paper
Inclusion is undecidable for pattern languages2019-03-29Paper
Depth of Closed Classes of Truth Functions in Many-Valued Logic2018-09-20Paper
https://portal.mardi4nfdi.de/entity/Q53763432018-09-17Paper
TWOPRIME: A fast stream ciphering algorithm2018-05-09Paper
Ambiguity, Nondeterminism and State Complexity of Finite Automata2017-08-25Paper
Minimal reaction systems: duration and blips2017-06-15Paper
https://portal.mardi4nfdi.de/entity/Q55070762016-12-16Paper
Two-Step Simulations of Reaction Systems by Minimal Ones2016-05-03Paper
Minimal and almost minimal reaction systems2016-04-21Paper
Applications of the Chinese remainder theorem to reaction systems with duration2015-09-16Paper
Minimal Reaction Systems Defining Subset Functions2015-09-08Paper
GOODBY TO THE KINDHEARTED DRAGON PROF. SHENG YU, 1950–20122014-08-04Paper
Undecidability of state complexity2013-10-22Paper
FUNCTIONAL CONSTRUCTIONS BETWEEN REACTION SYSTEMS AND PROPOSITIONAL LOGIC2013-07-30Paper
The Universe is Lawless or “Pantôn chrêmatôn metron anthrôpon einai”2013-02-26Paper
Functions and sequences generated by reaction systems2013-02-19Paper
https://portal.mardi4nfdi.de/entity/Q49041582013-01-28Paper
Undecidability of State Complexities Using Mirror Images2012-11-01Paper
Sheng Yu (1950–2012) In Memoriam2012-10-31Paper
Preface2012-10-11Paper
On State Sequences Defined by Reaction Systems2012-07-16Paper
Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism2012-06-25Paper
https://portal.mardi4nfdi.de/entity/Q28933132012-06-20Paper
Composition Sequences and Synchronizing Automata2012-06-15Paper
Preface2012-05-30Paper
https://portal.mardi4nfdi.de/entity/Q31009202011-11-22Paper
On Some Biologically Motivated Control Devices for Parallel Rewriting2011-06-24Paper
Undecidability of the State Complexity of Composed Regular Operations2011-06-03Paper
https://portal.mardi4nfdi.de/entity/Q30025072011-05-20Paper
POWER SUMS ASSOCIATED WITH CERTAIN RECURSIVE PROCEDURES ON WORDS2011-02-23Paper
Subword balance, position indices and power sums2010-10-07Paper
https://portal.mardi4nfdi.de/entity/Q49294002010-09-22Paper
https://portal.mardi4nfdi.de/entity/Q49294122010-09-22Paper
Criteria for the matrix equivalence of words2010-04-15Paper
SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES2010-03-09Paper
COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES2010-01-29Paper
https://portal.mardi4nfdi.de/entity/Q36553672010-01-07Paper
Variants of codes and indecomposable languages2009-11-27Paper
https://portal.mardi4nfdi.de/entity/Q36460792009-11-19Paper
https://portal.mardi4nfdi.de/entity/Q33959792009-09-15Paper
Aspects of Molecular Computing2009-05-14Paper
Length Codes, Products of Languages and Primality2008-11-20Paper
Subword histories and associated matrices2008-11-18Paper
State complexity of basic language operations combined with reversal2008-10-08Paper
https://portal.mardi4nfdi.de/entity/Q54483032008-03-20Paper
https://portal.mardi4nfdi.de/entity/Q54222442007-10-17Paper
State complexity of combined operations2007-09-19Paper
SPIKING NEURAL P SYSTEMS: AN EARLY SURVEY2007-06-05Paper
On the existence of prime decompositions2007-05-11Paper
https://portal.mardi4nfdi.de/entity/Q34255922007-02-26Paper
Subword conditions and subword histories2007-01-22Paper
https://portal.mardi4nfdi.de/entity/Q34099772006-11-21Paper
https://portal.mardi4nfdi.de/entity/Q34099782006-11-21Paper
Independence of certain quantities indicating subword occurrences2006-10-20Paper
Connections between subwords and certain matrix mappings2005-08-01Paper
https://portal.mardi4nfdi.de/entity/Q46813142005-06-23Paper
MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY2005-06-22Paper
https://portal.mardi4nfdi.de/entity/Q46719502005-04-28Paper
DNA computing. New computing paradigms.2005-04-26Paper
https://portal.mardi4nfdi.de/entity/Q46657442005-04-11Paper
https://portal.mardi4nfdi.de/entity/Q46657502005-04-11Paper
Three constructions of authentication/secrecy codes2005-04-07Paper
https://portal.mardi4nfdi.de/entity/Q46628442005-03-30Paper
https://portal.mardi4nfdi.de/entity/Q46574842005-03-14Paper
Subword histories and Parikh matrices2004-09-08Paper
https://portal.mardi4nfdi.de/entity/Q48086172004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47382912004-08-11Paper
On the state complexity of reversals of regular languages2004-08-10Paper
https://portal.mardi4nfdi.de/entity/Q44378122003-12-15Paper
https://portal.mardi4nfdi.de/entity/Q44363532003-12-04Paper
https://portal.mardi4nfdi.de/entity/Q44313642003-10-22Paper
https://portal.mardi4nfdi.de/entity/Q44313502003-10-21Paper
https://portal.mardi4nfdi.de/entity/Q44302962003-10-20Paper
From Watson-Crick L systems to Darwinian P systems2003-10-15Paper
https://portal.mardi4nfdi.de/entity/Q44266812003-09-16Paper
Power and size of extended Watson-Crick \(L\) systems.2003-08-17Paper
Cartesian authentication codes from functions with optimal nonlinearity.2003-08-17Paper
Watson-Crick D0L systems: The power of one transition2003-07-30Paper
https://portal.mardi4nfdi.de/entity/Q44147242003-07-27Paper
Some decision problems concerning semilinearity and commutation.2003-05-14Paper
Composition sequences for functions over a finite domain.2003-01-22Paper
Topics in the theory of DNA computing.2003-01-21Paper
Restricted use of the splicing operation12002-12-19Paper
https://portal.mardi4nfdi.de/entity/Q47820972002-11-27Paper
A sharpening of the Parikh mapping2002-09-18Paper
https://portal.mardi4nfdi.de/entity/Q45418132002-07-31Paper
ICALP, EATCS and Maurice Nivat2002-07-15Paper
Uni-transitional Watson-Crick D0L systems2002-07-15Paper
https://portal.mardi4nfdi.de/entity/Q45350492002-06-12Paper
Operations and language generating devices suggested by the genome evolution2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27766102002-02-28Paper
https://portal.mardi4nfdi.de/entity/Q27706882002-02-13Paper
https://portal.mardi4nfdi.de/entity/Q45038312001-09-04Paper
https://portal.mardi4nfdi.de/entity/Q45057042001-09-04Paper
Watson-Crick D0L systems with regular triggers2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q45270582001-06-27Paper
https://portal.mardi4nfdi.de/entity/Q27089482001-04-04Paper
https://portal.mardi4nfdi.de/entity/Q27072362001-04-01Paper
https://portal.mardi4nfdi.de/entity/Q45202672001-02-26Paper
https://portal.mardi4nfdi.de/entity/Q45202822001-02-26Paper
https://portal.mardi4nfdi.de/entity/Q45203152001-02-26Paper
https://portal.mardi4nfdi.de/entity/Q49343182001-02-15Paper
A characterization of poly-slender context-free languages2001-02-06Paper
https://portal.mardi4nfdi.de/entity/Q47904202001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47904222001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47904242001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47904272001-01-01Paper
Language-theoretic aspects of DNA complementarity2000-12-12Paper
https://portal.mardi4nfdi.de/entity/Q31292982000-11-20Paper
On slender 0L languages2000-08-23Paper
https://portal.mardi4nfdi.de/entity/Q49422422000-07-20Paper
https://portal.mardi4nfdi.de/entity/Q49422642000-07-20Paper
On strongly context-free languages2000-07-11Paper
Pattern languages with and without erasing2000-07-04Paper
https://portal.mardi4nfdi.de/entity/Q44851492000-06-05Paper
2-testability and relabelings produce everything2000-05-18Paper
https://portal.mardi4nfdi.de/entity/Q49422482000-05-11Paper
On the expressiveness of subset-sum representations2000-05-09Paper
https://portal.mardi4nfdi.de/entity/Q49386202000-04-25Paper
https://portal.mardi4nfdi.de/entity/Q49420392000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q49426532000-03-16Paper
https://portal.mardi4nfdi.de/entity/Q49390102000-02-23Paper
Contexts on trajectories2000-01-31Paper
https://portal.mardi4nfdi.de/entity/Q42636931999-11-21Paper
https://portal.mardi4nfdi.de/entity/Q42345071999-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42345061999-11-03Paper
https://portal.mardi4nfdi.de/entity/Q42664861999-10-24Paper
https://portal.mardi4nfdi.de/entity/Q42639501999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42603951999-09-19Paper
https://portal.mardi4nfdi.de/entity/Q42181241999-06-21Paper
A comparative overview of cryptographic voting protocols1999-06-16Paper
https://portal.mardi4nfdi.de/entity/Q42261871999-01-24Paper
https://portal.mardi4nfdi.de/entity/Q42261911999-01-24Paper
Characterizations of recursively enumerable languages by means of insertion grammars1999-01-12Paper
On well quasi orders of free monoids1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42236731999-01-06Paper
https://portal.mardi4nfdi.de/entity/Q42237811999-01-06Paper
DNA computing, sticker systems, and universality1998-11-08Paper
https://portal.mardi4nfdi.de/entity/Q43801481998-09-06Paper
Shuffle on trajectories: Syntactic constraints1998-08-13Paper
https://portal.mardi4nfdi.de/entity/Q38388261998-08-13Paper
Simple splicing systems1998-07-28Paper
https://portal.mardi4nfdi.de/entity/Q43855291998-05-14Paper
Characterizations of re languages starting from internal contextual languages1998-04-27Paper
Finite degrees of ambiguity in pattern languages1998-03-16Paper
Language-theoretic aspects of string replication1998-03-11Paper
https://portal.mardi4nfdi.de/entity/Q43795551998-03-02Paper
https://portal.mardi4nfdi.de/entity/Q43708351998-01-07Paper
https://portal.mardi4nfdi.de/entity/Q43710121998-01-07Paper
https://portal.mardi4nfdi.de/entity/Q43556781997-11-20Paper
Pattern Languages Versus Parallel Communicating Grammar Systems1997-09-15Paper
https://portal.mardi4nfdi.de/entity/Q31251781997-08-07Paper
https://portal.mardi4nfdi.de/entity/Q31292861997-07-06Paper
Geometric Transformations of Language Families: The Power of Symmetry1997-06-16Paper
Pattern systems1997-02-28Paper
Multi-pattern languages1997-02-28Paper
Computing by splicing1997-02-27Paper
Slender 0L languages1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q27855571997-02-25Paper
Self-Reading Sequences1997-01-05Paper
https://portal.mardi4nfdi.de/entity/Q48868021996-12-11Paper
https://portal.mardi4nfdi.de/entity/Q48787151996-10-21Paper
https://portal.mardi4nfdi.de/entity/Q48787101996-10-08Paper
https://portal.mardi4nfdi.de/entity/Q48787251996-10-07Paper
https://portal.mardi4nfdi.de/entity/Q48938591996-09-26Paper
https://portal.mardi4nfdi.de/entity/Q48880941996-07-23Paper
https://portal.mardi4nfdi.de/entity/Q48849001996-07-08Paper
Teams in cooperating grammar systems1996-07-01Paper
https://portal.mardi4nfdi.de/entity/Q48647911996-06-27Paper
On symmetry in strings, sequences and languages1996-05-28Paper
https://portal.mardi4nfdi.de/entity/Q48746611996-04-28Paper
https://portal.mardi4nfdi.de/entity/Q49422491996-01-01Paper
On the generative capacity of parallel communicating grammar systems1995-11-20Paper
P, NP, and the Post correspondence problem1995-11-14Paper
https://portal.mardi4nfdi.de/entity/Q48528861995-10-25Paper
Thin and slender languages1995-08-27Paper
https://portal.mardi4nfdi.de/entity/Q48390171995-07-13Paper
On parallel deletions applied to a word1995-07-11Paper
https://portal.mardi4nfdi.de/entity/Q48375631995-07-03Paper
Decision problems for patterns1995-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43045391995-06-08Paper
https://portal.mardi4nfdi.de/entity/Q47635131995-04-18Paper
https://portal.mardi4nfdi.de/entity/Q43189901995-02-06Paper
https://portal.mardi4nfdi.de/entity/Q43206531995-02-02Paper
Conducting secret ballot elections in computer networks: Problems and solutions1995-01-08Paper
Closure properties of slender languages1994-11-29Paper
Language-theoretic problems arising from Richelieu cryptosystems1994-10-19Paper
https://portal.mardi4nfdi.de/entity/Q42983511994-08-29Paper
On the union of 0L languages1994-06-09Paper
https://portal.mardi4nfdi.de/entity/Q42941731994-05-24Paper
On simplest possible solutions for Post Correspondence Problems1994-05-10Paper
https://portal.mardi4nfdi.de/entity/Q42842321994-03-24Paper
GRAMMARS BASED ON PATTERNS1994-01-13Paper
https://portal.mardi4nfdi.de/entity/Q42742041994-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42719191993-12-12Paper
PCP-prime words and primality types1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40365941993-05-18Paper
Simple reductions between \(D0L\) language and sequence equivalence problems1993-05-16Paper
On the generative capacity of parallel communicating grammar systems1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40051891992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40051931992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40052011992-09-27Paper
Caractérisation results about $L$ codes1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39979441992-09-17Paper
Bounded delay L codes1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q47126531992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47133731992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39712531992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39712681992-06-25Paper
Many aspects of formal languages1991-01-01Paper
A deterministic algorithm for modular knapsack problems1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31993261990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33484251990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38237961989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38176331988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37733701987-01-01Paper
Decision problems resulting from grammatical inference1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38042131987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38117281987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42050651987-01-01Paper
On a public-key cryptosystem based on iterated morphisms and substitutions1986-01-01Paper
Systolic trellis automata: Stability, decidability and complexity1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37048801986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37402431986-01-01Paper
Denseness, maximality, and decidability of grammatical families1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37599501986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37716201986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36802791985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36965401985-01-01Paper
Syntactic monoids in the construction of systolic tree automata1985-01-01Paper
On meta-normal forms for algebraic power series in noncommuting variables1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37390531985-01-01Paper
Systolic trellis automatata †1984-01-01Paper
Systolic trellis automatat†1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36877241984-01-01Paper
L codes and number systems1983-01-01Paper
On a family of L languages resulting from systolic tree automata1983-01-01Paper
Systolic automata for VLSI on balanced trees1983-01-01Paper
On finite grammar forms1983-01-01Paper
Ambiguity and decision problems concerning number systems1983-01-01Paper
A Supernormal-Form Theorem for Context-Free Grammars1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37055101983-01-01Paper
A homomorphic characterization of regular languages1982-01-01Paper
On infinite words obtained by iterating morphisms1982-01-01Paper
Finitary and infinitary interpretations of languages1982-01-01Paper
Dense Hierarchies of Grammatical Families1982-01-01Paper
Colorings and interpretations: a connection between graphs and grammar forms1981-01-01Paper
Sub-regular grammar forms1981-01-01Paper
Completeness of context-free grammar forms1981-01-01Paper
Decidability and density in two-symbol grammar forms1981-01-01Paper
Table systems with unconditional transfer1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47452811981-01-01Paper
On predecessors of finite languages1981-01-01Paper
Derivation languages of grammar forms†1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39456101981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39475811981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39486081981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39486091981-01-01Paper
On color-families of graphs1981-01-01Paper
Uniform Interpretations of Grammar Forms1981-01-01Paper
Synchronized EOL forms1980-01-01Paper
Context-free grammar forms with strict interpretations1980-01-01Paper
On generators and generative capacity of EOL forms1980-01-01Paper
Test sets and checking words for homomorphism equivalence1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47467871980-01-01Paper
Pure grammars1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38933401980-01-01Paper
MSW spaces1980-01-01Paper
On non context-free grammar forms1979-01-01Paper
Context-dependent L forms1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38592681979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38735661979-01-01Paper
Isomorphism, form equivalence and sequence equivalence of PDOL forms1978-01-01Paper
Bibliography of L systems1978-01-01Paper
ETOL forms1978-01-01Paper
On the decidability of homomorphism equivalence for languages1978-01-01Paper
Uniform interpretations of L forms1978-01-01Paper
On Good EOL Forms1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41558371978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41702581978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41742521978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41944841978-01-01Paper
EOL forms1977-01-01Paper
On the form equivalence of L-forms1977-01-01Paper
New squeezing mechanisms for L systems1977-01-01Paper
Context-free grammars with graph-controlled tables1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40986661976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41058001976-01-01Paper
Developmental systems with fragmentation1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41280301976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41310471976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41404071976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40768001975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40898011975-01-01Paper
Solution of a decision problem concerning unary Lindenmayer systems1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40501821974-01-01Paper
Some Remarks Concerning Many-Valued Propositional Logics1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40604221974-01-01Paper
On sentential forms of context-free grammars1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44044611973-01-01Paper
Integral sequential word functions and growth equivalence of lindenmayer systems1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41228361973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56784351973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56842481973-01-01Paper
Matrix grammars with a leftmost restriction1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56674721972-01-01Paper
The generative capacity of transformational grammars of ginsburg and partee1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41034701970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56211091970-01-01Paper
Periodically time-variant context-free grammars1970-01-01Paper
On the index of a context-free grammar and language1969-01-01Paper
Probabilistic and weighted grammars1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55886671969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55886751969-01-01Paper
On Events Represented by Probabilistic Automata of Different Types1968-01-01Paper
Two Complete Axiom Systems for the Extended Language of Regular Expressions1968-01-01Paper
On regular expressions and regular canonical systems1968-01-01Paper
On finite automata with a time-variant structure1968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56032021968-01-01Paper
On m-adic probabilistic automata1967-01-01Paper
Two Complete Axiom Systems for the Algebra of Regular Events1966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56198171966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53433131965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53433481965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55114021965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55114131965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53322201964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55549851964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57352011964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57370831964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38498811963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53441581963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55191161963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57293161963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57317691963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57317701963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32872371962-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32872381962-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32656581960-01-01Paper
A theorem concerning the composition of functions of several variables ranging over a finite set1960-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32691311959-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Arto Salomaa