The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Arto Salomaa: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  195. Characteristic Words for Parikh Matrices. [Citation Graph (, )][DBLP]


  196. Length Codes, Products of Languages and Primality. [Citation Graph (, )][DBLP]


  197. Preface. [Citation Graph (, )][DBLP]


Search in 0.153secs, Finished in 0.160secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002