| 2009 |
|---|
| 224 | EE | David W. Corne,
Pierluigi Frisco,
Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Membrane Computing - 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers
Springer 2009 |
| 2008 |
|---|
| 223 | EE | Arto Salomaa,
Kai Salomaa,
Sheng Yu:
Length Codes, Products of Languages and Primality.
LATA 2008: 476-486 |
| 222 | EE | 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) |
| 221 | EE | Arto Salomaa:
Subword histories and associated matrices.
Theor. Comput. Sci. 407(1-3): 250-257 (2008) |
| 2007 |
|---|
| 220 | | George Eleftherakis,
Petros Kefalas,
Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Membrane Computing, 8th International Workshop, WMC 2007, Thessaloniki, Greece, June 25-28, 2007 Revised Selected and Invited Papers
Springer 2007 |
| 219 | EE | Arto Salomaa:
Subword Balance in BinaryWords, Languages and Sequences.
Fundam. Inform. 75(1-4): 469-482 (2007) |
| 218 | EE | 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) |
| 217 | EE | Arto Salomaa:
Comparing Subword Occurrences in Binary D0L Sequences.
Int. J. Found. Comput. Sci. 18(6): 1395-1406 (2007) |
| 216 | EE | 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) |
| 215 | EE | Arto Salomaa,
Kai Salomaa,
Sheng Yu:
State complexity of combined operations.
Theor. Comput. Sci. 383(2-3): 140-152 (2007) |
| 2006 |
|---|
| 214 | | Rudolf Freund,
Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Membrane Computing, 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers
Springer 2006 |
| 213 | | Hendrik Jan Hoogeboom,
Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Membrane Computing, 7th International Workshop, WMC 2006, Leiden, The Netherlands, July 17-21, 2006, Revised, Selected, and Invited Papers
Springer 2006 |
| 212 | EE | Cunsheng Ding,
Arto Salomaa:
Secret Sharing Schemes with Nice Access Structures.
Fundam. Inform. 73(1-2): 51-63 (2006) |
| 211 | EE | Cunsheng Ding,
Arto Salomaa:
On Some Problems of Mateescu Concerning Subword Occurrences.
Fundam. Inform. 73(1-2): 65-79 (2006) |
| 210 | EE | Arto Salomaa,
Sheng Yu:
Subword conditions and subword histories.
Inf. Comput. 204(12): 1741-1755 (2006) |
| 209 | EE | Arto Salomaa:
Independence of certain quantities indicating subword occurrences.
Theor. Comput. Sci. 362(1-3): 222-231 (2006) |
| 2005 |
|---|
| 208 | | Giancarlo Mauri,
Gheorghe Paun,
Mario J. Pérez-Jiménez,
Grzegorz Rozenberg,
Arto Salomaa:
Membrane Computing, 5th International Workshop, WMC 2004, Milan, Italy, June 14-16, 2004, Revised Selected and Invited Papers
Springer 2005 |
| 207 | EE | Arto Salomaa:
On the Injectivity of Parikh Matrix Mappings.
Fundam. Inform. 64(1-4): 391-404 (2005) |
| 206 | EE | Arto Salomaa:
Connections between subwords and certain matrix mappings.
Theor. Comput. Sci. 340(1): 188-203 (2005) |
| 2004 |
|---|
| 205 | | Carlos Martín-Vide,
Giancarlo Mauri,
Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain, July 17-22, 2003, Revised Papers
Springer 2004 |
| 204 | EE | Erzsébet Csuhaj-Varjú,
Arto Salomaa:
The Power of Networks of Watson-Crick D0L Systems.
Aspects of Molecular Computing 2004: 106-118 |
| 203 | EE | Alexandru Mateescu,
Arto Salomaa:
Matrix Indicators For Subword Occurrences And Ambiguity.
Int. J. Found. Comput. Sci. 15(2): 277-292 (2004) |
| 202 | EE | Alexandru Mateescu,
Arto Salomaa,
Sheng Yu:
Subword histories and Parikh matrices.
J. Comput. Syst. Sci. 68(1): 1-21 (2004) |
| 201 | EE | Arto Salomaa,
Derick Wood,
Sheng Yu:
On the state complexity of reversals of regular languages.
Theor. Comput. Sci. 320(2-3): 315-329 (2004) |
| 2003 |
|---|
| 200 | | Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa,
Claudio Zandron:
Membrane Computing, International Workshop, WMC-CdeA 2002, Curtea de Arges, Romania, August 19-23, 2002, Revised Papers
Springer 2003 |
| 199 | EE | Cunsheng Ding,
Arto Salomaa,
Patrick Solé,
Xiaojian Tian:
Three Constructions of Authentication/Secrecy Codes.
AAECC 2003: 24-33 |
| 198 | | Arto Salomaa:
Counting (scattered) Subwords.
Bulletin of the EATCS 81: 165-179 (2003) |
| 197 | EE | 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) |
| 196 | EE | Arto Salomaa,
Petr Sosík:
Watson-Crick D0L systems: the power of one transition.
Theor. Comput. Sci. 1-3(301): 187-200 (2003) |
| 195 | | 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) |
| 194 | | Samuel T. Chanson,
Cunsheng Ding,
Arto Salomaa:
Cartesian authentication codes from functions with optimal nonlinearity.
Theor. Comput. Sci. 290(3): 1737-1752 (2003) |
| 193 | | Arto Salomaa:
Composition sequences for functions over a finite domain.
Theor. Comput. Sci. 292(1): 263-281 (2003) |
| 2002 |
|---|
| 192 | | Werner Kuich,
Grzegorz Rozenberg,
Arto Salomaa:
Developments in Language Theory, 5th International Conference, DLT 2001, Vienna, Austria, July 16-21, 2001, Revised Papers
Springer 2002 |
| 191 | | Wilfried Brauer,
Hartmut Ehrig,
Juhani Karhumäki,
Arto Salomaa:
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Springer 2002 |
| 190 | EE | Arto Salomaa:
DNA Complementarity and Paradigms of Computing.
COCOON 2002: 3-17 |
| 189 | EE | Alexandru Mateescu,
Arto Salomaa:
Nondeterministic Trajectories.
Formal and Natural Computing 2002: 96-106 |
| 188 | EE | Arto Salomaa:
Synchronization of Finite Automata: Contributions to an Old Problem.
The Essence of Computation 2002: 37-59 |
| 187 | EE | Alexandru Mateescu,
Arto Salomaa,
Sheng Yu:
Factorizations of Languages and Commutativity Conditions.
Acta Cybern. 15(3): 339-351 (2002) |
| 186 | EE | 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) |
| 185 | EE | Arto Salomaa:
Generation of Constants and Synchronization of Finite Automata.
J. UCS 8(2): 332-347 (2002) |
| 184 | EE | 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) |
| 183 | EE | Grzegorz Rozenberg,
Arto Salomaa:
ICALP, EATCS and Maurice Nivat.
Theor. Comput. Sci. 281(1-2): 25-30 (2002) |
| 182 | EE | Arto Salomaa:
Uni-transitional Watson-Crick D0L systems.
Theor. Comput. Sci. 281(1-2): 537-553 (2002) |
| 181 | | Martyn Amos,
Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Topics in the theory of DNA computing.
Theor. Comput. Sci. 287(1): 3-38 (2002) |
| 2001 |
|---|
| 180 | | Cristian Calude,
Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
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]
Springer 2001 |
| 179 | | Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Current Trends in Theoretical Computer Science, Entering the 21th Century
World Scientific 2001 |
| 178 | EE | Tero Harju,
Oscar H. Ibarra,
Juhani Karhumäki,
Arto Salomaa:
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages.
ICALP 2001: 579-590 |
| 177 | | Arto Salomaa:
Iterated Morphisms with Complementarity on the DNA Alphabet.
Words, Semigroups, and Transductions 2001: 405-420 |
| 176 | | Alexandru Mateescu,
Arto Salomaa:
Many-Valued Truth Functions, Cernys' Conjecture, and Road Coloring.
Current Trends in Theoretical Computer Science 2001: 693-707 |
| 175 | | Marjo Lipponen,
Arto Salomaa:
Simple Words in Equality Sets.
Current Trends in Theoretical Computer Science 2001: 717-733 |
| 174 | | Valeria Mihalache,
Arto Salomaa:
Lindenmayer and DNA: Watson-Crick D0L Systems.
Current Trends in Theoretical Computer Science 2001: 740-751 |
| 173 | | Erzsébet Csuhaj-Varjú,
Arto Salomaa:
Networks of Language Processors: Parallel Communicating Systems.
Current Trends in Theoretical Computer Science 2001: 791-810 |
| 172 | EE | Alexandru Mateescu,
Arto Salomaa,
Kai Salomaa,
Sheng Yu:
A sharpening of the Parikh mapping.
ITA 35(6): 551-564 (2001) |
| 171 | EE | Valeria Mihalache,
Arto Salomaa:
Language-theoretic aspects of DNA complematarity.
Theor. Comput. Sci. 250(1-2): 163-178 (2001) |
| 170 | EE | Juha Honkala,
Arto Salomaa:
Watson-Crick D0L systems with regular triggers.
Theor. Comput. Sci. 259(1-2): 689-698 (2001) |
| 2000 |
|---|
| 169 | | Arto Salomaa,
Derick Wood,
Sheng Yu:
A Half-Century of Automata Theory: Celebration and Inspiration
World Scientific 2000 |
| 168 | | Arto Salomaa:
Compositions over a Finite Domain: From Completeness to Synchronizable Automata.
A Half-Century of Automata Theory 2000: 131-143 |
| 167 | EE | Lucian Ilie,
Arto Salomaa:
On the Expressiveness of Subset-Sum Representations.
Acta Inf. 36(8): 665-672 (2000) |
| 166 | | Arto Salomaa:
Depth of Functional Compositions.
Bulletin of the EATCS 71: 143-150 (2000) |
| 165 | | Lucian Ilie,
Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
On strongly context-free languages.
Discrete Applied Mathematics 103(1-3): 153-165 (2000) |
| 164 | | Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Membrane Computing with External Output.
Fundam. Inform. 41(3): 313-340 (2000) |
| 163 | | Lucian Ilie,
Grzegorz Rozenberg,
Arto Salomaa:
A characterization of poly-slender context-free languages.
ITA 34(1): 77-86 (2000) |
| 162 | EE | Taishin Y. Nishida,
Arto Salomaa:
On slender 0L languages.
Theor. Comput. Sci. 233(1-2): 279-286 (2000) |
| 1999 |
|---|
| 161 | | Gheorghe Paun,
Arto Salomaa:
Grammatical Models of Multi-Agent Systems
Gordon and Breach Science Publishers 1999 |
| 160 | | Arto Salomaa,
Sheng Yu:
On the decomposition of finite languages.
Developments in Language Theory 1999: 22-31 |
| 159 | EE | Arto Salomaa:
Caesar and DNA. Views on Cryptology.
FCT 1999: 39-53 |
| 158 | EE | Grzegorz Rozenberg,
Arto Salomaa:
DNA Computing: New Ideas and Paradigms.
ICALP 1999: 106-118 |
| 157 | EE | Arto Salomaa:
Watson-Crick Walks and Roads on DOL Graphs.
Acta Cybern. 14(1): 179-192 (1999) |
| 156 | | Alexandru Mateescu,
Arto Salomaa:
Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring.
Bulletin of the EATCS 68: 134-150 (1999) |
| 1998 |
|---|
| 155 | EE | Tero Harju,
Alexandru Mateescu,
Arto Salomaa:
Shuffle on Trajectories: The Schützenberger Product and Related Operations.
MFCS 1998: 503-511 |
| 154 | EE | Lila Kari,
Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa,
Sheng Yu:
DNA Computing, Sticker Systems, and Universality.
Acta Inf. 35(5): 401-420 (1998) |
| 153 | | Erzsébet Csuhaj-Varjú,
Arto Salomaa:
Networks of Language Processors: Parallel Communicating Systems.
Bulletin of the EATCS 66: 122-138 (1998) |
| 152 | EE | Alexandru Mateescu,
Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Simple Splicing Systems.
Discrete Applied Mathematics 84(1-3): 145-163 (1998) |
| 151 | | Lucian Ilie,
Arto Salomaa:
2-Testability and Relabelings Produce Everything.
J. Comput. Syst. Sci. 56(3): 253-262 (1998) |
| 150 | EE | Alexandru Mateescu,
Grzegorz Rozenberg,
Arto Salomaa:
Shuffle on Trajectories: Syntactic Constraints.
Theor. Comput. Sci. 197(1-2): 1-56 (1998) |
| 149 | EE | Lucian Ilie,
Arto Salomaa:
On Well Quasi Orders of Free Monoids.
Theor. Comput. Sci. 204(1-2): 131-152 (1998) |
| 148 | EE | 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) |
| 1997 |
|---|
| 147 | | Gheorghe Paun,
Arto Salomaa:
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Springer 1997 |
| 146 | | Jan Mycielski,
Grzegorz Rozenberg,
Arto Salomaa:
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Springer 1997 |
| 145 | EE | Cunsheng Ding,
Valtteri Niemi,
Ari Renvall,
Arto Salomaa:
TWOPRIME: A Fast Stream Ciphering Algorithm.
FSE 1997: 88-102 |
| 144 | EE | Alexandru Mateescu,
Grzegorz Rozenberg,
Arto Salomaa:
Syntactic and Semantic Aspects of Parallelism.
Foundations of Computer Science: Potential - Theory - Cognition 1997: 79-105 |
| 143 | | Erzsébet Csuhaj-Varjú,
Arto Salomaa:
Networks of Parallel Language Processors.
New Trends in Formal Languages 1997: 299-318 |
| 142 | | Alexandru Mateescu,
George Daniel Mateescu,
Grzegorz Rozenberg,
Arto Salomaa:
Shuffle-like Operations on omega-words.
New Trends in Formal Languages 1997: 395-411 |
| 141 | | Arto Salomaa:
Conjugate Words, Cuts of the Deck and Cryptographic Protocols.
Bulletin of the EATCS 61: (1997) |
| 140 | | Valeria Mihalache,
Arto Salomaa:
Lindenmayer and DNA: Watson-Crick D0L Systems.
Bulletin of the EATCS 62: (1997) |
| 139 | | Alexandru Mateescu,
Grzegorz Rozenberg,
Arto Salomaa:
Geometric Transformations on Language Families: The Power of Symmetry.
Int. J. Found. Comput. Sci. 8(1): 1- (1997) |
| 138 | | Sorina Dumitrescu,
Gheorghe Paun,
Arto Salomaa:
Pattern Languages Versus Parallel Communicating Grammar Systems.
Int. J. Found. Comput. Sci. 8(1): 67- (1997) |
| 1996 |
|---|
| 137 | | Gheorghe Paun,
Arto Salomaa:
From DNA Recombination to DNA Computing, Via Formal Languages.
German Conference on Bioinformatics 1996: 93-98 |
| 136 | | Gheorghe Paun,
Arto Salomaa:
From DNA Recombination to DNA Computing, Via Formal Languages.
German Conference on Bioinformatics - Selected Papers 1996: 210-220 |
| 135 | EE | 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) |
| 134 | EE | Valeria Mihalache,
Arto Salomaa:
Growth Functions and Length Sets of Replicating Systems.
Acta Cybern. 12(3): 235-248 (1996) |
| 133 | EE | Lucian Ilie,
Arto Salomaa:
On Regular Characterizations of Languages by Grammar Systems.
Acta Cybern. 12(4): 411-426 (1996) |
| 132 | | Alexandru Mateescu,
Arto Salomaa:
Views on Linguistics.
Bulletin of the EATCS 58: (1996) |
| 131 | | Arto Salomaa:
Conjugate Words, Cuts of the Deck and Cryptographic Protocol.
Bulletin of the EATCS 59: (1996) |
| 130 | | Marjo Lipponen,
Arto Salomaa:
Simple Words in Equality Sets.
Bulletin of the EATCS 60: 123-143 (1996) |
| 129 | | Cunsheng Ding,
Arto Salomaa:
On Cooperatively Distributed Ciphering and Hashing.
Computers and Artificial Intelligence 15(2-3): (1996) |
| 128 | | Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Contextual Grammars: Parallelism and Blocking of Derivation.
Fundam. Inform. 25(3): 381-397 (1996) |
| 127 | | Lila Kari,
Gheorghe Paun,
Arto Salomaa:
The Power of Restricted Splicing with Rules from a Regular Language.
J. UCS 2(4): 224-240 (1996) |
| 126 | | Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Pattern Grammars.
Journal of Automata, Languages and Combinatorics 1(3): 219-242 (1996) |
| 125 | EE | Victor Mitrana,
Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Pattern Systems.
Theor. Comput. Sci. 154(2): 183-201 (1996) |
| 124 | EE | Taishin Y. Nishida,
Arto Salomaa:
Slender 0L Languages.
Theor. Comput. Sci. 158(1&2): 161-176 (1996) |
| 123 | EE | Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Computing by Splicing.
Theor. Comput. Sci. 168(2): 321-336 (1996) |
| 1995 |
|---|
| 122 | EE | Lila Kari,
Grzegorz Rozenberg,
Arto Salomaa:
Generalised DOL Trees.
Acta Cybern. 12(1): 1-10 (1995) |
| 121 | | Arto Salomaa:
Return to Patterns.
Bulletin of the EATCS 55: (1995) |
| 120 | | Arto Salomaa:
From Parikh vectors to GO territories.
Bulletin of the EATCS 56: (1995) |
| 119 | EE | Gheorghe Paun,
Arto Salomaa:
Thin and Slender Languages.
Discrete Applied Mathematics 61(3): 257-270 (1995) |
| 118 | | Lila Kari,
Alexandru Mateescu,
Gheorghe Paun,
Arto Salomaa:
On Parallel Deletions Applied to a Word.
ITA 29(2): 129-144 (1995) |
| 117 | | Alexandru Mateescu,
Arto Salomaa,
Kai Salomaa,
Sheng Yu:
P, NP and the Post Correspondence Problem
Inf. Comput. 121(2): 135-142 (1995) |
| 116 | | Tao Jiang,
Arto Salomaa,
Kai Salomaa,
Sheng Yu:
Decision Problems for Patterns.
J. Comput. Syst. Sci. 50(1): 53-63 (1995) |
| 115 | EE | Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Grammars Based on the Shuffle Operation.
J. UCS 1(1): 67-81 (1995) |
| 114 | EE | Alexandru Mateescu,
Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Parikh Prime Words and GO-like Territories.
J. UCS 1(12): 790-810 (1995) |
| 113 | EE | Erzsébet Csuhaj-Varjú,
Gheorghe Paun,
Arto Salomaa:
Conditional Tabled Eco-Grammar Systems.
J. UCS 1(5): 252-268 (1995) |
| 112 | EE | Alexandru Mateescu,
Arto Salomaa,
Kai Salomaa,
Sheng Yu:
Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model.
J. UCS 1(5): 292-311 (1995) |
| 111 | EE | Lila Kari,
Alexandru Mateescu,
Gheorghe Paun,
Arto Salomaa:
Multi-Pattern Languages.
Theor. Comput. Sci. 141(1&2): 253-268 (1995) |
| 1994 |
|---|
| 110 | | Alexandru Mateescu,
Arto Salomaa:
Nondeterminism in Patterns.
STACS 1994: 661-668 |
| 109 | | Arto Salomaa:
Patterns.
Bulletin of the EATCS 54: 194-206 (1994) |
| 108 | | Alexandru Mateescu,
Arto Salomaa:
Finite Degrees of Ambiguity in Pattern Languages.
ITA 28(3-4): 233-253 (1994) |
| 107 | EE | Cristian Calude,
Hermann A. Maurer,
Arto Salomaa:
Journal of Universal Computer Science.
J. UCS 0(0): 109-115 (1994) |
| 1993 |
|---|
| 106 | | Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Contextual Grammars: Erasing, Determinism, One-Side Contexts.
Developments in Language Theory 1993: 370-388 |
| 105 | | Cristian Calude,
Arto Salomaa:
Algorithmically Coding the Universe.
Developments in Language Theory 1993: 472-492 |
| 104 | | Arto Salomaa:
Pattern Languages: Problems of Decidability and Generation.
FCT 1993: 121-132 |
| 103 | | Tao Jiang,
Arto Salomaa,
Kai Salomaa,
Sheng Yu:
Inclusion is Undecidable for Pattern Languages.
ICALP 1993: 301-312 |
| 102 | | Alexandru Mateescu,
Arto Salomaa:
Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes.
MFCS 1993: 174-184 |
| 101 | | Alexandru Mateescu,
Arto Salomaa:
On Simplest Possible Solutions for Post Correspondence Problems.
Acta Inf. 30(5): 441-457 (1993) |
| 100 | EE | Arto Salomaa:
Simple Reductions Between D0L Language and Sequence Equivalence Problems.
Discrete Applied Mathematics 41(3): 271-274 (1993) |
| 99 | | Lila Kari,
Alexandru Mateescu,
Arto Salomaa,
Gheorghe Paun:
Deletion Sets.
Fundam. Inform. 19(3/4): 355-370 (1993) |
| 98 | | Alexandru Mateescu,
Arto Salomaa:
PCP-Prime Words and Primality Types.
ITA 27(1): 57-70 (1993) |
| 97 | | Jürgen Dassow,
Gheorghe Paun,
Arto Salomaa:
On the Union of 0L Languages.
Inf. Process. Lett. 47(2): 59-63 (1993) |
| 96 | | Jürgen Dassow,
Gheorghe Paun,
Arto Salomaa:
Grammars Based on Patterns.
Int. J. Found. Comput. Sci. 4(1): 1-14 (1993) |
| 95 | | Lila Kari,
Alexandru Mateescu,
Arto Salomaa,
Gheorghe Paun:
Gramars with Oracles.
Sci. Ann. Cuza Univ. 2: 3-12 (1993) |
| 94 | | Gheorghe Paun,
Arto Salomaa:
Closure Properties of Slender Languages.
Theor. Comput. Sci. 120(2): 293-301 (1993) |
| 1992 |
|---|
| 93 | EE | 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) |
| 92 | | 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) |
| 91 | | Gheorghe Paun,
Arto Salomaa:
Decision Problems Concerning the Thinness of DOL Languages.
Bulletin of the EATCS 46: 171-181 (1992) |
| 90 | | Arto Salomaa:
What Emil said about the Post correspondance problem.
Bulletin of the EATCS 47: 154-165 (1992) |
| 89 | | Juha Honkala,
Arto Salomaa:
Characterization results about L codes.
ITA 26: 287-302 (1992) |
| 1991 |
|---|
| 88 | | Juha Honkala,
Arto Salomaa:
L Morphisms: Bounded Delay and Regularity of Ambiguity.
ICALP 1991: 566-574 |
| 87 | | Arto Salomaa:
Verifying and Recasting Secret Ballots in Computer Networks.
New Results and New Trends in Computer Science 1991: 283-289 |
| 86 | | Arto Salomaa:
L Codes and L Systems with Immigration.
Bulletin of the EATCS 43: 124-130 (1991) |
| 85 | | Arto Salomaa,
Kai Salomaa,
Sheng Yu:
Primary Types of Instances of the Post Correspondence Problem.
Bulletin of the EATCS 44: 226-241 (1991) |
| 84 | EE | Hannu Nurmi,
Arto Salomaa,
Lila Santean:
Secret ballot elections in computer networks.
Computers & Security 10(6): 553-560 (1991) |
| 83 | EE | Arto Salomaa:
Preface.
Discrete Applied Mathematics 32(2): 83 (1991) |
| 82 | EE | Arto Salomaa:
Many aspects of formal languages.
Inf. Sci. 57-58: 119-129 (1991) |
| 81 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
Bounded Delay L Codes.
Theor. Comput. Sci. 84(2): 265-279 (1991) |
| 80 | | Arto Salomaa:
A Deterministic Algorithm for Modular Knapsack Problems.
Theor. Comput. Sci. 88(1): 127-138 (1991) |
| 1990 |
|---|
| 79 | | Arto Salomaa:
Formal Language and Power Series.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 103-132 |
| 78 | | Arto Salomaa:
Decision problems arising from knapsack transformations.
Acta Cybern. 9(4): 419-440 (1990) |
| 77 | | Arto Salomaa:
Decidability in finite automata.
Bulletin of the EATCS 41: 175-183 (1990) |
| 76 | | Arto Salomaa,
Lila Santean:
Secret Selling of Secrets with Several Buyers.
Bulletin of the EATCS 42: 178-186 (1990) |
| 1989 |
|---|
| 75 | | Arto Salomaa:
The Formal Language Theory Column.
Bulletin of the EATCS 38: 107-122 (1989) |
| 1988 |
|---|
| 74 | | Timo Lepistö,
Arto Salomaa:
Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings
Springer 1988 |
| 73 | | Arto Salomaa:
Cryptography and Data Security.
IMYCS 1988: 220-244 |
| 72 | | Arto Salomaa,
Juhani Karhumäki:
The Formal Language Theory Column.
Bulletin of the EATCS 34: 82-96 (1988) |
| 71 | | Arto Salomaa:
The formal language theory column.
Bulletin of the EATCS 35: 82-96 (1988) |
| 70 | | Arto Salomaa:
The Formal Language Theory Column.
Bulletin of the EATCS 36: 85-95 (1988) |
| 69 | | Arto Salomaa:
A Pumping Result for 2-Context-Free Languages.
Theor. Comput. Sci. 62(3): 267-287 (1988) |
| 1987 |
|---|
| 68 | | Arto Salomaa:
Formal Language Theory Column - Two-way Thue.
Bulletin of the EATCS 32: 82-87 (1987) |
| 67 | | Arto Salomaa:
The formal Language Theory Column.
Bulletin of the EATCS 33: 42-53 (1987) |
| 1986 |
|---|
| 66 | | Werner Kuich,
Arto Salomaa:
Semirings, Automata, Languages
Springer 1986 |
| 65 | | Efim B. Kinber,
Arto Salomaa,
Sheng Yu:
On the equivalence of grammars inferred from derivation.
Bulletin of the EATCS 29: 39-45 (1986) |
| 64 | | Karel Culik II,
Jozef Gruska,
Arto Salomaa:
Systolic Trellis Automata: Stability, Decidability and Complexity
Information and Control 71(3): 218-230 (1986) |
| 63 | | Arto Salomaa:
On a Public-Key Cryptosystem Based on Iterated Morphisms and Substitutions.
Theor. Comput. Sci. 48(3): 283-296 (1986) |
| 1985 |
|---|
| 62 | | Arto Salomaa:
The Ehrenfeucht conjecture: a proof for language theorists.
Bulletin of the EATCS 27: 71-82 (1985) |
| 1984 |
|---|
| 61 | | Karel Culik II,
Arto Salomaa,
Derick Wood:
Systolic Tree Acceptors.
ITA 18(1): 53-69 (1984) |
| 1983 |
|---|
| 60 | | Karel Culik II,
Arto Salomaa:
Ambiguity and Decision Problems Concerning Number Systems.
ICALP 1983: 137-146 |
| 59 | | Karel Culik II,
Arto Salomaa:
Ambiguity and Decision Problems Concerning Number Systems
Information and Control 56(3): 139-153 (1983) |
| 58 | EE | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
A Supernormal-Form Theorem for Context-Free Grammars
J. ACM 30(1): 95-102 (1983) |
| 57 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
L Codes and Number Systems.
Theor. Comput. Sci. 22: 331-346 (1983) |
| 56 | | 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) |
| 1982 |
|---|
| 55 | | Karel Culik II,
Jozef Gruska,
Arto Salomaa:
Systolic Automata for VLSI on Balanced Trees.
Acta Inf. 18: 335-344 (1982) |
| 54 | EE | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
Dense Hierarchies of Grammatical Families.
J. ACM 29(1): 118-126 (1982) |
| 53 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
Finitary and Infinitary Interpretations of Languages.
Mathematical Systems Theory 15(3): 251-265 (1982) |
| 52 | | Karel Culik II,
Arto Salomaa:
On Infinite Words Obtained by Iterating Morphisms.
Theor. Comput. Sci. 19: 29-38 (1982) |
| 1981 |
|---|
| 51 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
Synchronized EOL Forms Under Uniform Interpretation.
ITA 15(4): 337-353 (1981) |
| 50 | | Thomas Ottmann,
Arto Salomaa,
Derick Wood:
Sub-Regular Grammar Forms.
Inf. Process. Lett. 12(4): 184-187 (1981) |
| 49 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
On Predecessors of Finite Languages
Information and Control 50(3): 259-275 (1981) |
| 48 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
Completeness of Context-Free Grammar Forms.
J. Comput. Syst. Sci. 23(1): 1-10 (1981) |
| 47 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
Uniform Interpretations of Grammar Forms.
SIAM J. Comput. 10(3): 483-502 (1981) |
| 1980 |
|---|
| 46 | | Arto Salomaa:
Grammatical Families.
ICALP 1980: 543-554 |
| 45 | | Arto Salomaa:
Equality sets for homomorphisms of free monoid.
Acta Cybern. 4: 127-139 (1980) |
| 44 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
On Generators and Generative Capacity of EOL Forms.
Acta Inf. 13: 87-107 (1980) |
| 43 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
Pure Grammars
Information and Control 44(1): 47-72 (1980) |
| 42 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
MSW Spaces
Information and Control 46(3): 187-199 (1980) |
| 41 | | Karel Culik II,
Arto Salomaa:
Test Sets and Checking Words for Homomorphism Equivalence.
J. Comput. Syst. Sci. 20(3): 379-395 (1980) |
| 40 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
Context-Free Grammar Forms with Strict Interpretations.
J. Comput. Syst. Sci. 21(1): 110-135 (1980) |
| 39 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
Synchronized E0L Forms.
Theor. Comput. Sci. 12: 135-159 (1980) |
| 1979 |
|---|
| 38 | | Arto Salomaa:
Power from Power Series.
MFCS 1979: 170-181 |
| 37 | | Hermann A. Maurer,
Grzegorz Rozenberg,
Arto Salomaa,
Derick Wood:
Pure interpretations for EOL forms.
ITA 13(1): (1979) |
| 36 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
Context-Dependent L Forms
Information and Control 42(1): 97-118 (1979) |
| 35 | | Hermann A. Maurer,
Martti Penttonen,
Arto Salomaa,
Derick Wood:
On Non Context-Free Grammar Forms.
Mathematical Systems Theory 12: 297-324 (1979) |
| 1978 |
|---|
| 34 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
Relative Goodness for EOL Forms.
ITA 12(4): (1978) |
| 33 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
Uniform Interpretations of L Forms
Information and Control 36(2): 157-173 (1978) |
| 32 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
ETOL Forms.
J. Comput. Syst. Sci. 16(3): 345-361 (1978) |
| 31 | | Karel Culik II,
Arto Salomaa:
On the Decidability of Homomorphism Equivalence for Languages.
J. Comput. Syst. Sci. 17(2): 163-175 (1978) |
| 30 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
On Good E0L Forms.
SIAM J. Comput. 7(2): 158-166 (1978) |
| 29 | | 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) |
| 1977 |
|---|
| 28 | | Arto Salomaa,
Magnus Steinby:
Automata, Languages and Programming, Fourth Colloquium, University of Turku, Finland, July 18-22, 1977, Proceedings
Springer 1977 |
| 27 | | Hermann A. Maurer,
Arto Salomaa,
Derick Wood:
EOL Forms
Acta Inf. 8: 75-96 (1977) |
| 26 | EE | Grzegorz Rozenberg,
Arto Salomaa:
New squeezing mechanisms for L systems.
Inf. Sci. 12(3): 187-201 (1977) |
| 25 | | Hermann A. Maurer,
Thomas Ottmann,
Arto Salomaa:
On the Form Equivalence of L-Forms.
Theor. Comput. Sci. 4(2): 199-225 (1977) |
| 24 | | Grzegorz Rozenberg,
Martti Penttonen,
Arto Salomaa:
Bibliography of L Systems.
Theor. Comput. Sci. 5(3): 339-354 (1977) |
| 1976 |
|---|
| 23 | | Arto Salomaa:
Recent Results on L Systems.
MFCS 1976: 115-123 |
| 22 | | Arto Salomaa:
Undecidable Problems Concerning Growth in Informationless Lindenmayer Systems.
Elektronische Informationsverarbeitung und Kybernetik 12(7): 331-335 (1976) |
| 21 | | Grzegorz Rozenberg,
Arto Salomaa:
Context-Free Grammars with Graph-Controlled Tables.
J. Comput. Syst. Sci. 13(1): 90-99 (1976) |
| 1975 |
|---|
| 20 | | Arto Salomaa:
Formal Power Series and Growth Functions of Lindenmayer Systems.
MFCS 1975: 101-113 |
| 1974 |
|---|
| 19 | | Grzegorz Rozenberg,
Arto Salomaa:
L Systems, Most of the papers were presented at a conference in Aarhus, Denmark, January 14-25, 1974
Springer 1974 |
| 18 | | Arto Salomaa:
Parallelism in Rewriting Systems.
ICALP 1974: 523-533 |
| 17 | | Arto Salomaa:
Iteration Grammars and Lindenmayer AFL's.
L Systems 1974: 250-253 |
| 16 | | 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) |
| 15 | | 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) |
| 1973 |
|---|
| 14 | | Arto Salomaa:
On some recent problems concerning developmental languages.
Automatentheorie und Formale Sprachen 1973: 23-34 |
| 13 | | Arto Salomaa:
L-Systems: A Device in Biologically Motivated Automata Theory.
MFCS 1973: 147-151 |
| 12 | | Arto Salomaa:
On Sentential Forms of Context-Free Grammars
Acta Inf. 2: 40-49 (1973) |
| 11 | | Azaria Paz,
Arto Salomaa:
Integral Sequential Word Functions and Growth Equivalence of Lindenmayer Systems
Information and Control 23(4): 313-343 (1973) |
| 1972 |
|---|
| 10 | | Arto Salomaa:
Matrix Grammars with a Leftmost Restriction
Information and Control 20(2): 143-149 (1972) |
| 1971 |
|---|
| 9 | | Arto Salomaa:
The Generative Capacity of Transformational Grammars of Ginsburg and Partee
Information and Control 18(3): 227-232 (1971) |
| 1970 |
|---|
| 8 | | Arto Salomaa:
Periodically Time-Variant Context-Free Grammars
Information and Control 17(3): 294-311 (1970) |
| 1969 |
|---|
| 7 | | Arto Salomaa:
On the Index of a Context-Free Grammar and Language
Information and Control 14(5): 474-477 (1969) |
| 6 | | Arto Salomaa:
Probabilistic and Weighted Grammars
Information and Control 15(6): 529-544 (1969) |
| 1968 |
|---|
| 5 | | Arto Salomaa:
On Finite Automata with a Time-Variant Structure
Information and Control 13(2): 85-98 (1968) |
| 4 | | Arto Salomaa:
On Regular Expressions and Regular Canonical Systems.
Mathematical Systems Theory 2(4): 341-355 (1968) |
| 1967 |
|---|
| 3 | | Arto Salomaa:
On m-adic Probabilistic Automata
Information and Control 10(2): 215-219 (1967) |
| 1966 |
|---|
| 2 | EE | Arto Salomaa:
Two Complete Axiom Systems for the Algebra of Regular Events.
J. ACM 13(1): 158-169 (1966) |
| 1960 |
|---|
| 1 | | 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) |
