Arto Salomaa

Erzsébet Csuhaj-Varjú, Marian Gheorghe, Grzegorz Rozenberg, Arto Salomaa, György Vaszil (Eds.): Membrane Computing - 13th International Conference, CMC 2012, Budapest, Hungary, August 28-31, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7762, Springer 2013, isbn 978-3-642-36750-2

Arto Salomaa: Mirror Images and Schemes for the Maximal Complexity of Nondeterminism. Fundam. Inform. 116(1-4): 237-249 (2012)

Arto Salomaa, Kai Salomaa, Andrew L. Szilard: Sheng Yu (1950-2012) In Memoriam. Fundam. Inform. 120(1): 71-74 (2012)

Francis Y. L. Chin, Oscar H. Ibarra, Sartaj Sahni, Arto Salomaa: Sheng Yu. Int. J. Found. Comput. Sci. 23(2) (2012)

Giorgio Ausiello, Hendrik Jan Hoogeboom, Juhani Karhumäki, Ion Petre, Arto Salomaa: Preface. Theor. Comput. Sci. 429: 1-20 (2012)

Arto Salomaa: Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism. Theor. Comput. Sci. 432: 85-93 (2012)

Grzegorz Rozenberg, Arto Salomaa: Preface. Theor. Comput. Sci. 454: 2-4 (2012)

Arto Salomaa: Functions and sequences generated by reaction systems. Theor. Comput. Sci. 466: 87-96 (2012)

Arto Salomaa: Undecidability of State Complexities Using Mirror Images. Languages Alive 2012: 221-235

Arto Salomaa: On State Sequences Defined by Reaction Systems. Logic and Program Semantics 2012: 271-282

Arto Salomaa: Composition Sequences and Synchronizing Automata. Computation, Physics and Beyond 2012: 403-416

Marian Gheorghe, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, Sergey Verlan (Eds.): Membrane Computing - 12th International Conference, CMC 2011, Fontainebleau, France, August 23-26, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7184, Springer 2012, isbn 978-3-642-28023-8

Juhani Karhumäki, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: Preface. Fundam. Inform. 110(1-4) (2011)

Arto Salomaa: Power Sums Associated with Certain Recursive Procedures on Words. Int. J. Found. Comput. Sci. 22(1): 261-272 (2011)

Arto Salomaa: On Some Biologically Motivated Control Devices for Parallel Rewriting. Computation, Cooperation, and Life 2011: 181-190

Arto Salomaa, Kai Salomaa, Sheng Yu: Undecidability of the State Complexity of Composed Regular Operations. LATA 2011: 489-498

Cristian S. Calude, Grzegorz Rozenberg, Arto Salomaa (Eds.): Rainbow of Computer Science - Dedicated to Hermann Maurer on the Occasion of His 70th Birthday. Lecture Notes in Computer Science 6570, Springer 2011, isbn 978-3-642-19390-3

Marian Gheorghe, Thomas Hinze, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa (Eds.): Membrane Computing - 11th International Conference, CMC 2010, Jena, Germany, August 24-27, 2010. Revised Selected Papers. Lecture Notes in Computer Science 6501, Springer 2011, isbn 978-3-642-18122-1

Arto Salomaa, Sheng Yu: Subword Occurrences, Parikh Matrices and Lyndon Images. Int. J. Found. Comput. Sci. 21(1): 91-111 (2010)

Arto Salomaa: Subword balance, position indices and power sums. J. Comput. Syst. Sci. 76(8): 861-871 (2010)

Helmut Jürgensen, Hermann A. Maurer, Arto Salomaa, Sheng Yu: Seventy Years Derick Wood. J. UCS 16(5): 577-585 (2010)

Arto Salomaa: Ordered Catenation Closures and Decompositions of Languages Related to a Language of Derick Wood. J. UCS 16(5): 821-832 (2010)

Arto Salomaa: Criteria for the matrix equivalence of words. Theor. Comput. Sci. 411(16-18): 1818-1827 (2010)

Gheorghe Paun, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Grzegorz Rozenberg, Arto Salomaa (Eds.): Membrane Computing, 10th International Workshop, WMC 2009, Curtea de Arges, Romania, August 24-27, 2009. Revised Selected and Invited Papers. Lecture Notes in Computer Science 5957, Springer 2010, isbn 978-3-642-11466-3

Arto Salomaa, Kai Salomaa, Sheng Yu: Variants of codes and indecomposable languages. Inf. Comput. 207(11): 1340-1349 (2009)

Arto Salomaa: Characteristic Words for Parikh Matrices. Automata, Formal Languages, and Related Topics 2009: 117-127

David W. Corne, Pierluigi Frisco, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa (Eds.): Membrane Computing - 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers. Lecture Notes in Computer Science 5391, Springer 2009, isbn 978-3-540-95884-0

Guangwu Liu, Carlos Martín-Vide, Arto Salomaa, Sheng Yu: State complexity of basic language operations combined with reversal. Inf. Comput. 206(9-10): 1178-1186 (2008)

Arto Salomaa: Subword histories and associated matrices. Theor. Comput. Sci. 407(1-3): 250-257 (2008)

Arto Salomaa, Kai Salomaa, Sheng Yu: Length Codes, Products of Languages and Primality. LATA 2008: 476-486

Arto Salomaa: Subword Balance in BinaryWords, Languages and Sequences. Fundam. Inform. 75(1-4): 469-482 (2007)

Gheorghe Paun, Mario J. Pérez-Jiménez, Arto Salomaa: Spiking Neural P Systems: an Early Survey. Int. J. Found. Comput. Sci. 18(3): 435-455 (2007)

Arto Salomaa: Comparing Subword Occurrences in Binary D0L Sequences. Int. J. Found. Comput. Sci. 18(6): 1395-1406 (2007)

Yo-Sub Han, Arto Salomaa, Kai Salomaa, Derick Wood, Sheng Yu: On the existence of prime decompositions. Theor. Comput. Sci. 376(1-2): 60-69 (2007)

Arto Salomaa, Kai Salomaa, Sheng Yu: State complexity of combined operations. Theor. Comput. Sci. 383(2-3): 140-152 (2007)

Arto Salomaa: On Languages Defined by Numerical Parameters. Formal Models, Languages and Applications 2007: 320-336

Guangwu Liu, Carlos Martín-Vide, Arto Salomaa, Sheng Yu: State Complexity of Basic Operations Combined with Reversal. LATA 2007: 355-366

George Eleftherakis, Petros Kefalas, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa (Eds.): Membrane Computing, 8th International Workshop, WMC 2007, Thessaloniki, Greece, June 25-28, 2007 Revised Selected and Invited Papers. Lecture Notes in Computer Science 4860, Springer 2007, isbn 978-3-540-77311-5

Cunsheng Ding, Arto Salomaa: Secret Sharing Schemes with Nice Access Structures. Fundam. Inform. 73(1-2): 51-63 (2006)

Cunsheng Ding, Arto Salomaa: On Some Problems of Mateescu Concerning Subword Occurrences. Fundam. Inform. 73(1-2): 65-79 (2006)

Arto Salomaa, Sheng Yu: Subword conditions and subword histories. Inf. Comput. 204(12): 1741-1755 (2006)

Arto Salomaa: Independence of certain quantities indicating subword occurrences. Theor. Comput. Sci. 362(1-3): 222-231 (2006)

Rudolf Freund, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa (Eds.): Membrane Computing, 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers. Lecture Notes in Computer Science 3850, Springer 2006, isbn 3-540-30948-9

Hendrik Jan Hoogeboom, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa (Eds.): Membrane Computing, 7th International Workshop, WMC 2006, Leiden, The Netherlands, July 17-21, 2006, Revised, Selected, and Invited Papers. Lecture Notes in Computer Science 4361, Springer 2006, isbn 3-540-69088-3

Arto Salomaa: On the Injectivity of Parikh Matrix Mappings. Fundam. Inform. 64(1-4): 391-404 (2005)

Arto Salomaa: Connections between subwords and certain matrix mappings. Theor. Comput. Sci. 340(1): 188-203 (2005)

Giancarlo Mauri, Gheorghe Paun, Mario J. Pérez-Jiménez, Grzegorz Rozenberg, Arto Salomaa (Eds.): Membrane Computing, 5th International Workshop, WMC 2004, Milan, Italy, June 14-16, 2004, Revised Selected and Invited Papers. Lecture Notes in Computer Science 3365, Springer 2005, isbn 3-540-25080-8

Alexandru Mateescu, Arto Salomaa: Matrix Indicators For Subword Occurrences And Ambiguity. Int. J. Found. Comput. Sci. 15(2): 277-292 (2004)

Alexandru Mateescu, Arto Salomaa, Sheng Yu: Subword histories and Parikh matrices. J. Comput. Syst. Sci. 68(1): 1-21 (2004)

Arto Salomaa, Derick Wood, Sheng Yu: On the state complexity of reversals of regular languages. Theor. Comput. Sci. 320(2-3): 315-329 (2004)

Erzsébet Csuhaj-Varjú, Arto Salomaa: The Power of Networks of Watson-Crick D0L Systems. Aspects of Molecular Computing 2004: 106-118

Carlos Martín-Vide, Giancarlo Mauri, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa (Eds.): Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain, July 17-22, 2003, Revised Papers. Lecture Notes in Computer Science 2933, Springer 2004, isbn 3-540-20895-X

Arto Salomaa: Counting (scattered) Subwords. Bulletin of the EATCS 81: 165-179 (2003)

Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Gheorghe Paun, Arto Salomaa: From Watson-Crick L systems to Darwinian P systems. Natural Computing 2(3): 299-318 (2003)

Arto Salomaa, Petr Sosík: Watson-Crick D0L systems: the power of one transition. Theor. Comput. Sci. 1-3(301): 187-200 (2003)

Judit Csima, Erzsébet Csuhaj-Varjú, Arto Salomaa: Power and size of extended Watson-Crick L systems. Theor. Comput. Sci. 290(3): 1665-1678 (2003)

Samuel T. Chanson, Cunsheng Ding, Arto Salomaa: Cartesian authentication codes from functions with optimal nonlinearity. Theor. Comput. Sci. 290(3): 1737-1752 (2003)

Arto Salomaa: Composition sequences for functions over a finite domain. Theor. Comput. Sci. 292(1): 263-281 (2003)

Cunsheng Ding, Arto Salomaa, Patrick Solé, Xiaojian Tian: Three Constructions of Authentication/Secrecy Codes. AAECC 2003: 24-33

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, Claudio Zandron (Eds.): Membrane Computing, International Workshop, WMC-CdeA 2002, Curtea de Arges, Romania, August 19-23, 2002, Revised Papers. Lecture Notes in Computer Science 2597, Springer 2003, isbn 3-540-00611-7

Alexandru Mateescu, Arto Salomaa, Sheng Yu: Factorizations of Languages and Commutativity Conditions. Acta Cybern. 15(3): 339-351 (2002)

Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa: Some Decision Problems Concerning Semilinearity and Commutation. J. Comput. Syst. Sci. 65(2): 278-294 (2002)

Arto Salomaa: Generation of Constants and Synchronization of Finite Automata. J. UCS 8(2): 332-347 (2002)

Jürgen Dassow, Victor Mitrana, Arto Salomaa: Operations and language generating devices suggested by the genome evolution. Theor. Comput. Sci. 270(1-2): 701-738 (2002)

Grzegorz Rozenberg, Arto Salomaa: ICALP, EATCS and Maurice Nivat. Theor. Comput. Sci. 281(1-2): 25-30 (2002)

Arto Salomaa: Uni-transitional Watson-Crick D0L systems. Theor. Comput. Sci. 281(1-2): 537-553 (2002)

Martyn Amos, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: Topics in the theory of DNA computing. Theor. Comput. Sci. 287(1): 3-38 (2002)

Arto Salomaa: Synchronization of Finite Automata: Contributions to an Old Problem. The Essence of Computation 2002: 37-59

Alexandru Mateescu, Arto Salomaa: Nondeterministic Trajectories. Formal and Natural Computing 2002: 96-106

Arto Salomaa: DNA Complementarity and Paradigms of Computing. COCOON 2002: 3-17

Wilfried Brauer, Hartmut Ehrig, Juhani Karhumäki, Arto Salomaa (Eds.): Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]. Lecture Notes in Computer Science 2300, Springer 2002, isbn 3-540-43190-X

Werner Kuich, Grzegorz Rozenberg, Arto Salomaa (Eds.): Developments in Language Theory, 5th International Conference, DLT 2001, Vienna, Austria, July 16-21, 2001, Revised Papers. Lecture Notes in Computer Science 2295, Springer 2002, isbn 3-540-43453-4

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa (Eds.): Current Trends in Theoretical Computer Science, Entering the 21th Century. World Scientific 2001, isbn 981-02-4473-8

Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu: A sharpening of the Parikh mapping. ITA 35(6): 551-564 (2001)

Valeria Mihalache, Arto Salomaa: Language-theoretic aspects of DNA complematarity. Theor. Comput. Sci. 250(1-2): 163-178 (2001)

Juha Honkala, Arto Salomaa: Watson-Crick D0L systems with regular triggers. Theor. Comput. Sci. 259(1-2): 689-698 (2001)

Alexandru Mateescu, Arto Salomaa: Many-Valued Truth Functions, Cernys' Conjecture, and Road Coloring. Current Trends in Theoretical Computer Science 2001: 693-707

Marjo Lipponen, Arto Salomaa: Simple Words in Equality Sets. Current Trends in Theoretical Computer Science 2001: 717-733

Valeria Mihalache, Arto Salomaa: Lindenmayer and DNA: Watson-Crick D0L Systems. Current Trends in Theoretical Computer Science 2001: 740-751

Erzsébet Csuhaj-Varjú, Arto Salomaa: Networks of Language Processors: Parallel Communicating Systems. Current Trends in Theoretical Computer Science 2001: 791-810

Carlos Martín-Vide, Alexandru Mateescu, Arto Salomaa: Sewing contexts and mildly context-sensitive languages. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 75-84

Arto Salomaa: Iterated Morphisms with Complementarity on the DNA Alphabet. Words, Semigroups, and Transductions 2001: 405-420

Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa: Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages. ICALP 2001: 579-590

Cristian Calude, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa (Eds.): Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View [Workshop on Multiset Processing, WMP 2000, Curtea de Arges, Romania, August 21-25, 2000]. Lecture Notes in Computer Science 2235, Springer 2001, isbn 3-540-43063-6

Lucian Ilie, Arto Salomaa: On the Expressiveness of Subset-Sum Representations. Acta Inf. 36(8): 665-672 (2000)

Lucian Ilie, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: On strongly context-free languages. Discrete Applied Mathematics 103(1-3): 153-165 (2000)

Arto Salomaa: Depth of Functional Compositions. Bulletin of the EATCS 71: 143-150 (2000)

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: Membrane Computing with External Output. Fundam. Inform. 41(3): 313-340 (2000)

Lucian Ilie, Grzegorz Rozenberg, Arto Salomaa: A characterization of poly-slender context-free languages. ITA 34(1): 77-86 (2000)

Taishin Y. Nishida, Arto Salomaa: On slender 0L languages. Theor. Comput. Sci. 233(1-2): 279-286 (2000)

Erzsébet Csuhaj-Varjú, Arto Salomaa: Networks of Watson-Crick D0L Systems. Words, Languages & Combinatorics 2000: 134-150

Arto Salomaa: Compositions over a Finite Domain: From Completeness to Synchronizable Automata. A Half-Century of Automata Theory 2000: 131-143

Arto Salomaa, Derick Wood, Sheng Yu (Eds.): A Half-Century of Automata Theory: Celebration and Inspiration. World Scientific 2000, isbn 981-02-4590-4

Arto Salomaa: Watson-Crick Walks and Roads on DOL Graphs. Acta Cybern. 14(1): 179-192 (1999)

Alexandru Mateescu, Arto Salomaa: Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring. Bulletin of the EATCS 68: 134-150 (1999)

Arto Salomaa, Sheng Yu: On the decomposition of finite languages. Developments in Language Theory 1999: 22-31

Arto Salomaa: Caesar and DNA. Views on Cryptology. FCT 1999: 39-53

Grzegorz Rozenberg, Arto Salomaa: DNA Computing: New Ideas and Paradigms. ICALP 1999: 106-118

Gheorghe Paun, Arto Salomaa (Eds.): Grammatical Models of Multi-Agent Systems. Topics in Computer Mathematics 8, Gordon and Breach Science Publishers 1999, isbn 90-5699-177-9

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: DNA computing - new computing paradigms. Texts in theoretical computer science, Springer 1998, isbn 978-3-540-64196-4, pp. I-IX, 1-402

Lila Kari, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, Sheng Yu: DNA Computing, Sticker Systems, and Universality. Acta Inf. 35(5): 401-420 (1998)

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: Complementarity versus universality: Keynotes of DNA computing. Complexity 4(1): 14-19 (1998)

Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: Simple Splicing Systems. Discrete Applied Mathematics 84(1-3): 145-163 (1998)

Erzsébet Csuhaj-Varjú, Arto Salomaa: Networks of Language Processors: Parallel Communicating Systems. Bulletin of the EATCS 66: 122-138 (1998)

Lucian Ilie, Arto Salomaa: 2-Testability and Relabelings Produce Everything. J. Comput. Syst. Sci. 56(3): 253-262 (1998)

Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa: Shuffle on Trajectories: Syntactic Constraints. Theor. Comput. Sci. 197(1-2): 1-56 (1998)

Lucian Ilie, Arto Salomaa: On Well Quasi Orders of Free Monoids. Theor. Comput. Sci. 204(1-2): 131-152 (1998)

Carlos Martín-Vide, Gheorghe Paun, Arto Salomaa: Characterizations of Recursively Enumerable Languages by Means of Insertion Grammars. Theor. Comput. Sci. 205(1-2): 195-205 (1998)

Tero Harju, Alexandru Mateescu, Arto Salomaa: Shuffle on Trajectories: The Schützenberger Product and Related Operations. MFCS 1998: 503-511

Arto Salomaa: Conjugate Words, Cuts of the Deck and Cryptographic Protocols. Bulletin of the EATCS 61 (1997)

Valeria Mihalache, Arto Salomaa: Lindenmayer and DNA: Watson-Crick D0L Systems. Bulletin of the EATCS 62 (1997)

Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa: Geometric Transformations on Language Families: The Power of Symmetry. Int. J. Found. Comput. Sci. 8(1): 1-14 (1997)

Sorina Dumitrescu, Gheorghe Paun, Arto Salomaa: Pattern Languages Versus Parallel Communicating Grammar Systems. Int. J. Found. Comput. Sci. 8(1): 67-80 (1997)

Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa: Syntactic and Semantic Aspects of Parallelism. Foundations of Computer Science: Potential - Theory - Cognition 1997: 79-105

Erzsébet Csuhaj-Varjú, Arto Salomaa: Networks of Parallel Language Processors. New Trends in Formal Languages 1997: 299-318

Alexandru Mateescu, George Daniel Mateescu, Grzegorz Rozenberg, Arto Salomaa: Shuffle-like Operations on omega-words. New Trends in Formal Languages 1997: 395-411

Cunsheng Ding, Valtteri Niemi, Ari Renvall, Arto Salomaa: TWOPRIME: A Fast Stream Ciphering Algorithm. FSE 1997: 88-102

Gheorghe Paun, Arto Salomaa (Eds.): New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday). Lecture Notes in Computer Science 1218, Springer 1997, isbn 3-540-62844-4

Jan Mycielski, Grzegorz Rozenberg, Arto Salomaa (Eds.): Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht. Lecture Notes in Computer Science 1261, Springer 1997, isbn 3-540-63246-8

Arto Salomaa: Public key cryptography (2. ed.). Texts in theoretical computer science, Springer 1996, isbn 978-3-540-61356-5, pp. I-X, 1-271

Andrzej Ehrenfeucht, Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: On Representing RE Languages by One-Sided Internal Contextual Languages. Acta Cybern. 12(3): 217-234 (1996)

Valeria Mihalache, Arto Salomaa: Growth Functions and Length Sets of Replicating Systems. Acta Cybern. 12(3): 235-248 (1996)

Lucian Ilie, Arto Salomaa: On Regular Characterizations of Languages by Grammar Systems. Acta Cybern. 12(4): 411-426 (1996)

Cunsheng Ding, Arto Salomaa: On Cooperatively Distributed Ciphering and Hashing. Computers and Artificial Intelligence 15(2-3) (1996)

Alexandru Mateescu, Arto Salomaa: Views on Linguistics. Bulletin of the EATCS 58 (1996)

Arto Salomaa: Conjugate Words, Cuts of the Deck and Cryptographic Protocol. Bulletin of the EATCS 59 (1996)

Marjo Lipponen, Arto Salomaa: Simple Words in Equality Sets. Bulletin of the EATCS 60: 123-143 (1996)

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: Contextual Grammars: Parallelism and Blocking of Derivation. Fundam. Inform. 25(3): 381-397 (1996)

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: Pattern Grammars. Journal of Automata, Languages and Combinatorics 1(3): 219-242 (1996)

Lila Kari, Gheorghe Paun, Arto Salomaa: The Power of Restricted Splicing with Rules from a Regular Language. J. UCS 2(4): 224-240 (1996)

Victor Mitrana, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: Pattern Systems. Theor. Comput. Sci. 154(2): 183-201 (1996)

Taishin Y. Nishida, Arto Salomaa: Slender 0L Languages. Theor. Comput. Sci. 158(1&2): 161-176 (1996)

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: Computing by Splicing. Theor. Comput. Sci. 168(2): 321-336 (1996)

Gheorghe Paun, Arto Salomaa: From DNA Recombination to DNA Computing, Via Formal Languages. German Conference on Bioinformatics 1996: 93-98

Gheorghe Paun, Arto Salomaa: From DNA Recombination to DNA Computing, Via Formal Languages. German Conference on Bioinformatics - Selected Papers 1996: 210-220

Lila Kari, Grzegorz Rozenberg, Arto Salomaa: Generalised DOL Trees. Acta Cybern. 12(1): 1-10 (1995)

Gheorghe Paun, Arto Salomaa: Thin and Slender Languages. Discrete Applied Mathematics 61(3): 257-270 (1995)

Arto Salomaa: Return to Patterns. Bulletin of the EATCS 55 (1995)

Arto Salomaa: From Parikh vectors to GO territories. Bulletin of the EATCS 56 (1995)

Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu: P, NP and the Post Correspondence Problem. Inf. Comput. 121(2): 135-142 (1995)

Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa: On Parallel Deletions Applied to a Word. ITA 29(2): 129-144 (1995)

Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu: Decision Problems for Patterns. J. Comput. Syst. Sci. 50(1): 53-63 (1995)

Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa: Teams in cooperating grammar systems. J. Exp. Theor. Artif. Intell. 7(4): 347-359 (1995)

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: Grammars Based on the Shuffle Operation. J. UCS 1(1): 67-81 (1995)

Erzsébet Csuhaj-Varjú, Gheorghe Paun, Arto Salomaa: Conditional Tabled Eco-Grammar Systems. J. UCS 1(5): 252-268 (1995)

Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu: Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model. J. UCS 1(5): 292-311 (1995)

Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: Parikh Prime Words and GO-like Territories. J. UCS 1(12): 790-810 (1995)

Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa: Multi-Pattern Languages. Theor. Comput. Sci. 141(1&2): 253-268 (1995)

Grzegorz Rozenberg, Arto Salomaa: Cornerstones of undecidability. Prentice Hall International Series in Computer Science, Prentice Hall 1994, isbn 978-0-13-297425-7, pp. I-XVI, 1-197

Arto Salomaa: Patterns. Bulletin of the EATCS 54: 194-206 (1994)

Alexandru Mateescu, Arto Salomaa: Finite Degrees of Ambiguity in Pattern Languages. ITA 28(3-4): 233-253 (1994)

Cristian Calude, Hermann A. Maurer, Arto Salomaa: Journal of Universal Computer Science. J. UCS 0(0): 109-115 (1994)

Alexandru Mateescu, Arto Salomaa: Nondeterminism in Patterns. STACS 1994: 661-668

Alexandru Mateescu, Arto Salomaa: On Simplest Possible Solutions for Post Correspondence Problems. Acta Inf. 30(5): 441-457 (1993)

Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun: Gramars with Oracles. Sci. Ann. Cuza Univ. 2: 3-12 (1993)

Arto Salomaa: Simple Reductions Between D0L Language and Sequence Equivalence Problems. Discrete Applied Mathematics 41(3): 271-274 (1993)

Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun: Deletion Sets. Fundam. Inform. 19(3/4): 355-370 (1993)

Jürgen Dassow, Gheorghe Paun, Arto Salomaa: Grammars Based on Patterns. Int. J. Found. Comput. Sci. 4(1): 1-14 (1993)

Jürgen Dassow, Gheorghe Paun, Arto Salomaa: On the Union of 0L Languages. Inf. Process. Lett. 47(2): 59-63 (1993)

Alexandru Mateescu, Arto Salomaa: PCP-Prime Words and Primality Types. ITA 27(1): 57-70 (1993)

Gheorghe Paun, Arto Salomaa: Closure Properties of Slender Languages. Theor. Comput. Sci. 120(2): 293-301 (1993)

Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: Contextual Grammars: Erasing, Determinism, One-Side Contexts. Developments in Language Theory 1993: 370-388

Cristian Calude, Arto Salomaa: Algorithmically Coding the Universe. Developments in Language Theory 1993: 472-492

Arto Salomaa: Pattern Languages: Problems of Decidability and Generation. FCT 1993: 121-132

Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu: Inclusion is Undecidable for Pattern Languages. ICALP 1993: 301-312

Alexandru Mateescu, Arto Salomaa: Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes. MFCS 1993: 174-184

Jürgen Dassow, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa: Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure. Acta Cybern. 10(4): 243-254 (1992)

Lila Kari, Solomon Marcus, Gheorghe Paun, Arto Salomaa: In the prehistory of formal language theory: Gauss Languages. Bulletin of the EATCS 46: 124-139 (1992)

Gheorghe Paun, Arto Salomaa: Decision Problems Concerning the Thinness of DOL Languages. Bulletin of the EATCS 46: 171-181 (1992)

Arto Salomaa: What Emil said about the Post correspondance problem. Bulletin of the EATCS 47: 154-165 (1992)

Juha Honkala, Arto Salomaa: Characterization results about L codes. ITA 26: 287-302 (1992)

Hannu Nurmi, Arto Salomaa, Lila Santean: Secret ballot elections in computer networks. Computers & Security 10(6): 553-560 (1991)

Arto Salomaa: Preface. Discrete Applied Mathematics 32(2): 83 (1991)

Arto Salomaa: L Codes and L Systems with Immigration. Bulletin of the EATCS 43: 124-130 (1991)

Arto Salomaa, Kai Salomaa, Sheng Yu: Primary Types of Instances of the Post Correspondence Problem. Bulletin of the EATCS 44: 226-241 (1991)

Arto Salomaa: Many aspects of formal languages. Inf. Sci. 57-58: 119-129 (1991)

Hermann A. Maurer, Arto Salomaa, Derick Wood: Bounded Delay L Codes. Theor. Comput. Sci. 84(2): 265-279 (1991)

Arto Salomaa: A Deterministic Algorithm for Modular Knapsack Problems. Theor. Comput. Sci. 88(1): 127-138 (1991)

Arto Salomaa: Verifying and Recasting Secret Ballots in Computer Networks. New Results and New Trends in Computer Science 1991: 283-289

Juha Honkala, Arto Salomaa: L Morphisms: Bounded Delay and Regularity of Ambiguity. ICALP 1991: 566-574

Arto Salomaa: Decision problems arising from knapsack transformations. Acta Cybern. 9(4): 419-440 (1990)

Arto Salomaa: Decidability in finite automata. Bulletin of the EATCS 41: 175-183 (1990)

Arto Salomaa, Lila Santean: Secret Selling of Secrets with Several Buyers. Bulletin of the EATCS 42: 178-186 (1990)

Arto Salomaa: Formal Language and Power Series. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 103-132

Arto Salomaa: The Formal Language Theory Column. Bulletin of the EATCS 38: 107-122 (1989)

Arto Salomaa, Juhani Karhumäki: The Formal Language Theory Column. Bulletin of the EATCS 34: 82-96 (1988)

Arto Salomaa: The formal language theory column. Bulletin of the EATCS 35: 82-96 (1988)

Arto Salomaa: The Formal Language Theory Column. Bulletin of the EATCS 36: 85-95 (1988)

Arto Salomaa: A Pumping Result for 2-Context-Free Languages. Theor. Comput. Sci. 62(3): 267-287 (1988)

Arto Salomaa: Cryptography and Data Security. IMYCS 1988: 220-244

Timo Lepistö, Arto Salomaa (Eds.): Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings. Lecture Notes in Computer Science 317, Springer 1988, isbn 3-540-19488-6

Arto Salomaa: Formal languages. Computer science classics, Academic Press 1987, isbn 978-0-12-615750-5, pp. I-XIII, 1-322

Arto Salomaa: Formal Language Theory Column - Two-way Thue. Bulletin of the EATCS 32: 82-87 (1987)

Arto Salomaa: The formal Language Theory Column. Bulletin of the EATCS 33: 42-53 (1987)

Grzegorz Rozenberg, Arto Salomaa: The book of L. Springer 1986, isbn 978-3-540-16022-9, pp. I-XV, 1-471

Werner Kuich, Arto Salomaa: Semirings, Automata, Languages. Monographs in Theoretical Computer Science. An EATCS Series 5, Springer 1986, isbn 3-540-13716-5

Efim B. Kinber, Arto Salomaa, Sheng Yu: On the equivalence of grammars inferred from derivation. Bulletin of the EATCS 29: 39-45 (1986)

Karel Culik II, Jozef Gruska, Arto Salomaa: Systolic Trellis Automata: Stability, Decidability and Complexity. Information and Control 71(3): 218-230 (1986)

Arto Salomaa: On a Public-Key Cryptosystem Based on Iterated Morphisms and Substitutions. Theor. Comput. Sci. 48(3): 283-296 (1986)

Arto Salomaa: The Ehrenfeucht conjecture: a proof for language theorists. Bulletin of the EATCS 27: 71-82 (1985)

Helmut Jürgensen, Arto Salomaa: Syntactic monoids in the construction of systolic tree automata. International Journal of Parallel Programming 14(1): 35-49 (1985)

Karel Culik II, Arto Salomaa, Derick Wood: Systolic Tree Acceptors. ITA 18(1): 53-69 (1984)

Karel Culik II, Arto Salomaa: Ambiguity and Decision Problems Concerning Number Systems. Information and Control 56(3): 139-153 (1983)

Hermann A. Maurer, Arto Salomaa, Derick Wood: A Supernormal-Form Theorem for Context-Free Grammars. J. ACM 30(1): 95-102 (1983)

Hermann A. Maurer, Arto Salomaa, Derick Wood: L Codes and Number Systems. Theor. Comput. Sci. 22: 331-346 (1983)

Karel Culik II, Jozef Gruska, Arto Salomaa: On a Family of L Languages Resulting from Systolic Tree Automata. Theor. Comput. Sci. 23: 231-242 (1983)

Karel Culik II, Arto Salomaa: Ambiguity and Decision Problems Concerning Number Systems. ICALP 1983: 137-146

Karel Culik II, Jozef Gruska, Arto Salomaa: Systolic Automata for VLSI on Balanced Trees. Acta Inf. 18: 335-344 (1982)

Hermann A. Maurer, Arto Salomaa, Derick Wood: Dense Hierarchies of Grammatical Families. J. ACM 29(1): 118-126 (1982)

Hermann A. Maurer, Arto Salomaa, Derick Wood: Finitary and Infinitary Interpretations of Languages. Mathematical Systems Theory 15(3): 251-265 (1982)

Karel Culik II, Arto Salomaa: On Infinite Words Obtained by Iterating Morphisms. Theor. Comput. Sci. 19: 29-38 (1982)

Hermann A. Maurer, Arto Salomaa, Derick Wood: On Predecessors of Finite Languages. Information and Control 50(3): 259-275 (1981)

Thomas Ottmann, Arto Salomaa, Derick Wood: Sub-Regular Grammar Forms. Inf. Process. Lett. 12(4): 184-187 (1981)

Hermann A. Maurer, Arto Salomaa, Derick Wood: Synchronized EOL Forms Under Uniform Interpretation. ITA 15(4): 337-353 (1981)

Hermann A. Maurer, Arto Salomaa, Derick Wood: Completeness of Context-Free Grammar Forms. J. Comput. Syst. Sci. 23(1): 1-10 (1981)

Hermann A. Maurer, Arto Salomaa, Derick Wood: Uniform Interpretations of Grammar Forms. SIAM J. Comput. 10(3): 483-502 (1981)

Hermann A. Maurer, Arto Salomaa, Derick Wood: On Generators and Generative Capacity of EOL Forms. Acta Inf. 13: 87-107 (1980)

Arto Salomaa: Equality sets for homomorphisms of free monoid. Acta Cybern. 4: 127-139 (1980)

Hermann A. Maurer, Arto Salomaa, Derick Wood: Pure Grammars. Information and Control 44(1): 47-72 (1980)

Hermann A. Maurer, Arto Salomaa, Derick Wood: MSW Spaces. Information and Control 46(3): 187-199 (1980)

Karel Culik II, Arto Salomaa: Test Sets and Checking Words for Homomorphism Equivalence. J. Comput. Syst. Sci. 20(3): 379-395 (1980)

Hermann A. Maurer, Arto Salomaa, Derick Wood: Context-Free Grammar Forms with Strict Interpretations. J. Comput. Syst. Sci. 21(1): 110-135 (1980)

Hermann A. Maurer, Arto Salomaa, Derick Wood: Synchronized E0L Forms. Theor. Comput. Sci. 12: 135-159 (1980)

Arto Salomaa: Grammatical Families. ICALP 1980: 543-554

Hermann A. Maurer, Arto Salomaa, Derick Wood: Context-Dependent L Forms. Information and Control 42(1): 97-118 (1979)

Hermann A. Maurer, Grzegorz Rozenberg, Arto Salomaa, Derick Wood: Pure interpretations for EOL forms. ITA 13(1) (1979)

Hermann A. Maurer, Martti Penttonen, Arto Salomaa, Derick Wood: On Non Context-Free Grammar Forms. Mathematical Systems Theory 12: 297-324 (1979)

Arto Salomaa: Power from Power Series. MFCS 1979: 170-181

Arto Salomaa, Matti Soittola: Automata-theoretic aspects of formal power series. Texts and monographs in computer science, Springer 1978, isbn 978-0-387-90282-1, pp. I-X, 1-171

Arto Salomaa: Formale Sprachen. Springer 1978, isbn 978-3-540-09030-4, pp. I-XI, 1-314

Hermann A. Maurer, Arto Salomaa, Derick Wood: Uniform Interpretations of L Forms. Information and Control 36(2): 157-173 (1978)

Hermann A. Maurer, Arto Salomaa, Derick Wood: Relative Goodness for EOL Forms. ITA 12(4) (1978)

Hermann A. Maurer, Arto Salomaa, Derick Wood: ETOL Forms. J. Comput. Syst. Sci. 16(3): 345-361 (1978)

Karel Culik II, Arto Salomaa: On the Decidability of Homomorphism Equivalence for Languages. J. Comput. Syst. Sci. 17(2): 163-175 (1978)

Hermann A. Maurer, Arto Salomaa, Derick Wood: On Good E0L Forms. SIAM J. Comput. 7(2): 158-166 (1978)

Karel Culik II, Hermann A. Maurer, Thomas Ottmann, Keijo Ruohonen, Arto Salomaa: Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms. Theor. Comput. Sci. 6: 143-173 (1978)

Hermann A. Maurer, Arto Salomaa, Derick Wood: EOL Forms. Acta Inf. 8: 75-96 (1977)

Grzegorz Rozenberg, Arto Salomaa: New squeezing mechanisms for L systems. Inf. Sci. 12(3): 187-201 (1977)

Hermann A. Maurer, Thomas Ottmann, Arto Salomaa: On the Form Equivalence of L-Forms. Theor. Comput. Sci. 4(2): 199-225 (1977)

Grzegorz Rozenberg, Martti Penttonen, Arto Salomaa: Bibliography of L Systems. Theor. Comput. Sci. 5(3): 339-354 (1977)

Arto Salomaa, Magnus Steinby (Eds.): Automata, Languages and Programming, Fourth Colloquium, University of Turku, Finland, July 18-22, 1977, Proceedings. Lecture Notes in Computer Science 52, Springer 1977, isbn 3-540-08342-1

Arto Salomaa: Undecidable Problems Concerning Growth in Informationless Lindenmayer Systems. Elektronische Informationsverarbeitung und Kybernetik 12(7): 331-335 (1976)

Grzegorz Rozenberg, Arto Salomaa: Context-Free Grammars with Graph-Controlled Tables. J. Comput. Syst. Sci. 13(1): 90-99 (1976)

Arto Salomaa: Recent Results on L Systems. MFCS 1976: 115-123

Arto Salomaa: Formal Power Series and Growth Functions of Lindenmayer Systems. MFCS 1975: 101-113

Mogens Nielsen, Grzegorz Rozenberg, Arto Salomaa, Sven Skyum: Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. II. Nondeterministic Systems. Acta Inf. 3: 357-364 (1974)

Mogens Nielsen, Grzegorz Rozenberg, Arto Salomaa, Sven Skyum: Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. I. Deterministic Systems. Acta Inf. 4: 87-106 (1974)

Arto Salomaa: Iteration Grammars and Lindenmayer AFL's. L Systems 1974: 250-253

Arto Salomaa: Parallelism in Rewriting Systems. ICALP 1974: 523-533

Grzegorz Rozenberg, Arto Salomaa (Eds.): L Systems, Most of the papers were presented at a conference in Aarhus, Denmark, January 14-25, 1974. Lecture Notes in Computer Science 15, Springer 1974, isbn 3-540-06867-8

Arto Salomaa: On Sentential Forms of Context-Free Grammars. Acta Inf. 2: 40-49 (1973)

Azaria Paz, Arto Salomaa: Integral Sequential Word Functions and Growth Equivalence of Lindenmayer Systems. Information and Control 23(4): 313-343 (1973)

Arto Salomaa: On some recent problems concerning developmental languages. Automatentheorie und Formale Sprachen 1973: 23-34

Arto Salomaa: L-Systems: A Device in Biologically Motivated Automata Theory. MFCS 1973: 147-151

Arto Salomaa: Matrix Grammars with a Leftmost Restriction. Information and Control 20(2): 143-149 (1972)

Arto Salomaa: The Generative Capacity of Transformational Grammars of Ginsburg and Partee. Information and Control 18(3): 227-232 (1971)

Arto Salomaa: Periodically Time-Variant Context-Free Grammars. Information and Control 17(3): 294-311 (1970)

Arto Salomaa: On the Index of a Context-Free Grammar and Language. Information and Control 14(5): 474-477 (1969)

Arto Salomaa: Probabilistic and Weighted Grammars. Information and Control 15(6): 529-544 (1969)

Arto Salomaa: On Finite Automata with a Time-Variant Structure. Information and Control 13(2): 85-98 (1968)

Arto Salomaa: On Regular Expressions and Regular Canonical Systems. Mathematical Systems Theory 2(4): 341-355 (1968)

Arto Salomaa: On m-adic Probabilistic Automata. Information and Control 10(2): 215-219 (1967)

Arto Salomaa: Two Complete Axiom Systems for the Algebra of Regular Events. J. ACM 13(1): 158-169 (1966)

Arto Salomaa: A Theorem Concerning the Composition of Functions of Several Variables Ranging Over a Finite Set. J. Symb. Log. 25(3): 203-208 (1960)