default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArto Salomaa
Person information
- affiliation: University of Turku, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j215]Arto Salomaa, Kai Salomaa, Taylor J. Smith
:
Descriptional Complexity of Finite Automata - Selected Highlights. Fundam. Informaticae 191(3-4): 231-237 (2024)- [j214]Arto Salomaa, Magnus Steinby:
Volume Edited by Magnus Steinby. Int. J. Found. Comput. Sci. 35(1&2): 7-10 (2024) - 2023
- [j213]Manfred Droste, George Rahonis, Arto Salomaa:
Special Issue: International Colloquium: Recent Advances of Quantitative Models in Computer Science (RAQM 2021) - Preface. Int. J. Found. Comput. Sci. 34(6): 537-538 (2023) - [j212]Alastair A. Abbott, Cezar Câmpeanu, Ludwig Staiger, Marius Zimand, Arto Salomaa:
Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude). Theor. Comput. Sci. 952: 113819 (2023) - [i1]Arto Salomaa, Kai Salomaa, Taylor J. Smith:
Descriptional Complexity of Finite Automata - Selected Highlights. CoRR abs/2301.03708 (2023) - 2021
- [j211]Lila Kari, Ion Petre, Grzegorz Rozenberg, Arto Salomaa:
A fascinating rainbow of computation - Honoring Gheorghe Păun on the occasion of his 70th birthday. Theor. Comput. Sci. 862: 1-2 (2021) - [e39]Rudolf Freund, Tseren-Onolt Ishdorj, Grzegorz Rozenberg, Arto Salomaa, Claudio Zandron:
Membrane Computing - 21st International Conference, CMC 2020, Virtual Event, September 14-18, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12687, Springer 2021, ISBN 978-3-030-77101-0 [contents] - 2020
- [j210]Marian Gheorghe, Mario J. Pérez-Jiménez, Grzegorz Rozenberg, Arto Salomaa:
Preface of the special issue for Gheorghe Pǎun's 70th anniversary. J. Membr. Comput. 2(4): 227-229 (2020)
2010 – 2019
- 2019
- [e38]Thomas Hinze, Grzegorz Rozenberg, Arto Salomaa, Claudio Zandron:
Membrane Computing - 19th International Conference, CMC 2018, Dresden, Germany, September 4-7, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11399, Springer 2019, ISBN 978-3-030-12796-1 [contents] - 2018
- [j209]Arto Salomaa:
From Infinite to Finite by Identifying Variables in Many-Valued Logic. J. Autom. Lang. Comb. 23(1-3): 293-301 (2018) - [c53]Arto Salomaa:
Parikh Matrices: Subword Indicators and Degrees of Ambiguity. Adventures Between Lower Bounds and Higher Altitudes 2018: 100-112 - [e37]Carmen Graciani Díaz, Agustín Riscos-Núñez, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Enjoying Natural Computing - Essays Dedicated to Mario de Jesús Pérez-Jiménez on the Occasion of His 70th Birthday. Lecture Notes in Computer Science 11270, Springer 2018, ISBN 978-3-030-00264-0 [contents] - [e36]Marian Gheorghe, Grzegorz Rozenberg, Arto Salomaa, Claudio Zandron:
Membrane Computing - 18th International Conference, CMC 2017, Bradford, UK, July 25-28, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10725, Springer 2018, ISBN 978-3-319-73358-6 [contents] - 2017
- [j208]Yo-Sub Han, Arto Salomaa, Kai Salomaa:
Ambiguity, Nondeterminism and State Complexity of Finite Automata. Acta Cybern. 23(1): 141-157 (2017) - [j207]Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Preface. Fundam. Informaticae 154(1-4): vii (2017) - [j206]Arto Salomaa:
Minimal reaction systems: Duration and blips. Theor. Comput. Sci. 682: 208-216 (2017) - [j205]Gheorghe Paun, Ion Petre, Grzegorz Rozenberg, Arto Salomaa:
From finite state grammars to natural computing - In memory of Solomon Marcus. Theor. Comput. Sci. 701: 2-7 (2017) - [c52]Arto Salomaa:
Depth of Closed Classes of Truth Functions in Many-Valued Logic. The Role of Theory in Computer Science 2017: 203-216 - [e35]Alberto Leporati, Grzegorz Rozenberg, Arto Salomaa, Claudio Zandron:
Membrane Computing - 17th International Conference, CMC 2016, Milan, Italy, July 25-29, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10105, Springer 2017, ISBN 978-3-319-54071-9 [contents] - 2015
- [j204]Arto Salomaa:
Two-Step Simulations of Reaction Systems by Minimal Ones. Acta Cybern. 22(2): 247-257 (2015) - [j203]Arto Salomaa, Francis Y. L. Chin, Oscar H. Ibarra, Sartaj Sahni:
Alberto Apostolico. Int. J. Found. Comput. Sci. 26(5) (2015) - [j202]Arto Salomaa:
Applications of the Chinese remainder theorem to reaction systems with duration. Theor. Comput. Sci. 598: 15-22 (2015) - [e34]Grzegorz Rozenberg, Arto Salomaa, José M. Sempere, Claudio Zandron:
Membrane Computing - 16th International Conference, CMC 2015, Valencia, Spain, August 17-21, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9504, Springer 2015, ISBN 978-3-319-28474-3 [contents] - 2014
- [j201]Grzegorz Rozenberg, Arto Salomaa:
Wilfried Brauer (1937-2014) in memoriam. Bull. EATCS 113 (2014) - [j200]Arto Salomaa:
Compositions of Reaction Systems. J. Autom. Lang. Comb. 19(1-4): 279-290 (2014) - [c51]Arto Salomaa:
On Axiomatizations of General Many-Valued Propositional Calculi. Discrete Mathematics and Computer Science 2014: 259-270 - [c50]Arto Salomaa:
Minimal Reaction Systems Defining Subset Functions. Computing with New Resources 2014: 436-446 - [e33]Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005). The Publishing House of the Romanian Academy 2014, ISBN 978-973-27-2470-5 [contents] - [e32]Artiom Alhazov, Svetlana Cojocaru, Marian Gheorghe, Yurii Rogozhin, Grzegorz Rozenberg, Arto Salomaa:
Membrane Computing - 14th International Conference, CMC 2013, Chişinău, Republic of Moldova, August 20-23, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8340, Springer 2014, ISBN 978-3-642-54238-1 [contents] - [e31]Marian Gheorghe, Grzegorz Rozenberg, Arto Salomaa, Petr Sosík, Claudio Zandron:
Membrane Computing - 15th International Conference, CMC 2014, Prague, Czech Republic, August 20-22, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8961, Springer 2014, ISBN 978-3-319-14369-9 [contents] - 2013
- [j199]Arto Salomaa, Kai Salomaa, Sheng Yu:
Undecidability of state complexity. Int. J. Comput. Math. 90(6): 1310-1320 (2013) - [j198]Arto Salomaa:
Functional Constructions between reaction Systems and Propositional Logic. Int. J. Found. Comput. Sci. 24(1): 147-160 (2013) - [j197]Arto Salomaa, Kai Salomaa, Andrew L. Szilard:
Goodby to the Kindhearted Dragon Prof. Sheng Yu, 1950-2012. Int. J. Found. Comput. Sci. 24(7): 945-954 (2013) - [j196]Arto Salomaa:
Minimal and almost minimal reaction systems. Nat. Comput. 12(3): 369-376 (2013) - [e30]Erzsébet Csuhaj-Varjú, Marian Gheorghe, Grzegorz Rozenberg, Arto Salomaa, György Vaszil:
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 [contents] - 2012
- [j195]Arto Salomaa:
In Memoriam Sheng Yu (1950-2012). Bull. EATCS 106: 7-10 (2012) - [j194]Arto Salomaa:
Mirror Images and Schemes for the Maximal Complexity of Nondeterminism. Fundam. Informaticae 116(1-4): 237-249 (2012) - [j193]Arto Salomaa, Kai Salomaa, Andrew L. Szilard:
Sheng Yu (1950-2012) In Memoriam. Fundam. Informaticae 120(1): 71-74 (2012) - [j192]Francis Y. L. Chin, Oscar H. Ibarra, Sartaj Sahni, Arto Salomaa:
Sheng Yu. Int. J. Found. Comput. Sci. 23(2) (2012) - [j191]Giorgio Ausiello, Hendrik Jan Hoogeboom, Juhani Karhumäki, Ion Petre, Arto Salomaa:
Preface. Theor. Comput. Sci. 429: 1-20 (2012) - [j190]Arto Salomaa:
Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism. Theor. Comput. Sci. 432: 85-93 (2012) - [j189]Grzegorz Rozenberg, Arto Salomaa:
Preface. Theor. Comput. Sci. 454: 2-4 (2012) - [j188]Arto Salomaa:
Functions and sequences generated by reaction systems. Theor. Comput. Sci. 466: 87-96 (2012) - [c49]Arto Salomaa:
Undecidability of State Complexities Using Mirror Images. Languages Alive 2012: 221-235 - [c48]Arto Salomaa:
On State Sequences Defined by Reaction Systems. Logic and Program Semantics 2012: 271-282 - [c47]Arto Salomaa:
Composition Sequences and Synchronizing Automata. Computation, Physics and Beyond 2012: 403-416 - [e29]Marian Gheorghe, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, Sergey Verlan:
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 [contents] - 2011
- [j187]Juhani Karhumäki, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Preface. Fundam. Informaticae 110(1-4) (2011) - [j186]Arto Salomaa:
Power Sums Associated with Certain Recursive Procedures on Words. Int. J. Found. Comput. Sci. 22(1): 261-272 (2011) - [c46]Arto Salomaa:
On Some Biologically Motivated Control Devices for Parallel Rewriting. Computation, Cooperation, and Life 2011: 181-190 - [c45]Arto Salomaa, Kai Salomaa, Sheng Yu:
Undecidability of the State Complexity of Composed Regular Operations. LATA 2011: 489-498 - [e28]Cristian S. Calude, Grzegorz Rozenberg, Arto Salomaa:
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 [contents] - [e27]Marian Gheorghe, Thomas Hinze, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
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 [contents] - 2010
- [j185]Arto Salomaa, Sheng Yu:
Subword Occurrences, Parikh Matrices and Lyndon Images. Int. J. Found. Comput. Sci. 21(1): 91-111 (2010) - [j184]Arto Salomaa:
Subword balance, position indices and power sums. J. Comput. Syst. Sci. 76(8): 861-871 (2010) - [j183]Helmut Jürgensen, Hermann A. Maurer, Arto Salomaa, Sheng Yu:
Seventy Years Derick Wood. J. Univers. Comput. Sci. 16(5): 577-585 (2010) - [j182]Arto Salomaa:
Ordered Catenation Closures and Decompositions of Languages Related to a Language of Derick Wood. J. Univers. Comput. Sci. 16(5): 821-832 (2010) - [j181]Arto Salomaa:
Criteria for the matrix equivalence of words. Theor. Comput. Sci. 411(16-18): 1818-1827 (2010) - [e26]Gheorghe Paun, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Grzegorz Rozenberg, Arto Salomaa:
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 [contents]
2000 – 2009
- 2009
- [j180]Arto Salomaa, Kai Salomaa, Sheng Yu:
Variants of codes and indecomposable languages. Inf. Comput. 207(11): 1340-1349 (2009) - [c44]Arto Salomaa:
Grzegorz Rozenberg: A Magical Scientist and Brother. Algorithmic Bioprocesses 2009: 3-11 - [c43]Arto Salomaa:
Characteristic Words for Parikh Matrices. Automata, Formal Languages, and Related Topics 2009: 117-127 - [e25]Anne Condon, David Harel, Joost N. Kok, Arto Salomaa, Erik Winfree:
Algorithmic Bioprocesses. Natural Computing Series, Springer 2009, ISBN 978-3-540-88868-0 [contents] - [e24]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. Lecture Notes in Computer Science 5391, Springer 2009, ISBN 978-3-540-95884-0 [contents] - 2008
- [j179]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) - [j178]Arto Salomaa:
Subword histories and associated matrices. Theor. Comput. Sci. 407(1-3): 250-257 (2008) - [c42]Arto Salomaa, Kai Salomaa, Sheng Yu:
Length Codes, Products of Languages and Primality. LATA 2008: 476-486 - 2007
- [j177]Arto Salomaa:
Subword Balance in BinaryWords, Languages and Sequences. Fundam. Informaticae 75(1-4): 469-482 (2007) - [j176]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) - [j175]Arto Salomaa:
Comparing Subword Occurrences in Binary D0L Sequences. Int. J. Found. Comput. Sci. 18(6): 1395-1406 (2007) - [j174]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) - [j173]Arto Salomaa, Kai Salomaa, Sheng Yu:
State complexity of combined operations. Theor. Comput. Sci. 383(2-3): 140-152 (2007) - [c41]Arto Salomaa:
On Languages Defined by Numerical Parameters. Formal Models, Languages and Applications 2007: 320-336 - [c40]Guangwu Liu, Carlos Martín-Vide, Arto Salomaa, Sheng Yu:
State Complexity of Basic Operations Combined with Reversal. LATA 2007: 355-366 - [e23]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. Lecture Notes in Computer Science 4860, Springer 2007, ISBN 978-3-540-77311-5 [contents] - 2006
- [j172]Cunsheng Ding, Arto Salomaa:
Secret Sharing Schemes with Nice Access Structures. Fundam. Informaticae 73(1-2): 51-63 (2006) - [j171]Cunsheng Ding, Arto Salomaa:
On Some Problems of Mateescu Concerning Subword Occurrences. Fundam. Informaticae 73(1-2): 65-79 (2006) - [j170]Arto Salomaa, Sheng Yu:
Subword conditions and subword histories. Inf. Comput. 204(12): 1741-1755 (2006) - [j169]Arto Salomaa:
Independence of certain quantities indicating subword occurrences. Theor. Comput. Sci. 362(1-3): 222-231 (2006) - [e22]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. Lecture Notes in Computer Science 3850, Springer 2006, ISBN 3-540-30948-9 [contents] - [e21]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. Lecture Notes in Computer Science 4361, Springer 2006, ISBN 3-540-69088-3 [contents] - 2005
- [j168]Arto Salomaa:
On the Injectivity of Parikh Matrix Mappings. Fundam. Informaticae 64(1-4): 391-404 (2005) - [j167]Arto Salomaa:
Connections between subwords and certain matrix mappings. Theor. Comput. Sci. 340(1): 188-203 (2005) - [e20]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. Lecture Notes in Computer Science 3365, Springer 2005, ISBN 3-540-25080-8 [contents] - 2004
- [j166]Alexandru Mateescu, Arto Salomaa:
Matrix Indicators For Subword Occurrences And Ambiguity. Int. J. Found. Comput. Sci. 15(2): 277-292 (2004) - [j165]Alexandru Mateescu, Arto Salomaa, Sheng Yu:
Subword histories and Parikh matrices. J. Comput. Syst. Sci. 68(1): 1-21 (2004) - [j164]Arto Salomaa, Derick Wood, Sheng Yu:
On the state complexity of reversals of regular languages. Theor. Comput. Sci. 320(2-3): 315-329 (2004) - [c39]Erzsébet Csuhaj-Varjú, Arto Salomaa:
The Power of Networks of Watson-Crick D0L Systems. Aspects of Molecular Computing 2004: 106-118 - [e19]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. Lecture Notes in Computer Science 2933, Springer 2004, ISBN 3-540-20895-X [contents] - 2003
- [j163]Arto Salomaa:
Counting (scattered) Subwords. Bull. EATCS 81: 165-179 (2003) - [j162]Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Gheorghe Paun, Arto Salomaa:
From Watson-Crick L systems to Darwinian P systems. Nat. Comput. 2(3): 299-318 (2003) - [j161]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) - [j160]Samuel T. Chanson, Cunsheng Ding, Arto Salomaa:
Cartesian authentication codes from functions with optimal nonlinearity. Theor. Comput. Sci. 290(3): 1737-1752 (2003) - [j159]Arto Salomaa:
Composition sequences for functions over a finite domain. Theor. Comput. Sci. 292(1): 263-281 (2003) - [j158]Arto Salomaa, Petr Sosík:
Watson-Crick D0L systems: the power of one transition. Theor. Comput. Sci. 301(1-3): 187-200 (2003) - [c38]Cunsheng Ding, Arto Salomaa, Patrick Solé, Xiaojian Tian:
Three Constructions of Authentication/Secrecy Codes. AAECC 2003: 24-33 - [e18]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. Lecture Notes in Computer Science 2597, Springer 2003, ISBN 3-540-00611-7 [contents] - 2002
- [j157]Alexandru Mateescu, Arto Salomaa, Sheng Yu:
Factorizations of Languages and Commutativity Conditions. Acta Cybern. 15(3): 339-351 (2002) - [j156]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) - [j155]Arto Salomaa:
Generation of Constants and Synchronization of Finite Automata. J. Univers. Comput. Sci. 8(2): 332-347 (2002) - [j154]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) - [j153]Grzegorz Rozenberg, Arto Salomaa:
ICALP, EATCS and Maurice Nivat. Theor. Comput. Sci. 281(1-2): 25-30 (2002) - [j152]Arto Salomaa:
Uni-transitional Watson-Crick D0L systems. Theor. Comput. Sci. 281(1-2): 537-553 (2002) - [j151]Martyn Amos, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Topics in the theory of DNA computing. Theor. Comput. Sci. 287(1): 3-38 (2002) - [c37]Arto Salomaa:
Synchronization of Finite Automata: Contributions to an Old Problem. The Essence of Computation 2002: 37-59 - [c36]Alexandru Mateescu, Arto Salomaa:
Nondeterministic Trajectories. Formal and Natural Computing 2002: 96-106 - [c35]Arto Salomaa:
DNA Complementarity and Paradigms of Computing. COCOON 2002: 3-17 - [e17]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]. Lecture Notes in Computer Science 2300, Springer 2002, ISBN 3-540-43190-X [contents] - [e16]Werner Kuich, Grzegorz Rozenberg, Arto Salomaa:
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 [contents] - 2001
- [j150]Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu:
A sharpening of the Parikh mapping. RAIRO Theor. Informatics Appl. 35(6): 551-564 (2001) - [j149]Valeria Mihalache, Arto Salomaa:
Language-theoretic aspects of DNA complematarity. Theor. Comput. Sci. 250(1-2): 163-178 (2001) - [j148]Juha Honkala, Arto Salomaa:
Watson-Crick D0L systems with regular triggers. Theor. Comput. Sci. 259(1-2): 689-698 (2001) - [c34]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 - [c33]Arto Salomaa:
Iterated Morphisms with Complementarity on the DNA Alphabet. Words, Semigroups, and Transductions 2001: 405-420 - [c32]Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa:
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages. ICALP 2001: 579-590 - [p19]Alexandru Mateescu, Arto Salomaa:
Many-Valued Truth Functions, Cernys' Conjecture, and Road Coloring. Current Trends in Theoretical Computer Science 2001: 693-707 - [p18]Marjo Lipponen, Arto Salomaa:
Simple Words in Equality Sets. Current Trends in Theoretical Computer Science 2001: 717-733 - [p17]Valeria Mihalache, Arto Salomaa:
Lindenmayer and DNA: Watson-Crick D0L Systems. Current Trends in Theoretical Computer Science 2001: 740-751 - [p16]Erzsébet Csuhaj-Varjú, Arto Salomaa:
Networks of Language Processors: Parallel Communicating Systems. Current Trends in Theoretical Computer Science 2001: 791-810 - [e15]Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Current Trends in Theoretical Computer Science, Entering the 21th Century. World Scientific 2001, ISBN 981-02-4473-8 [contents] - [e14]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]. Lecture Notes in Computer Science 2235, Springer 2001, ISBN 3-540-43063-6 [contents] - 2000
- [j147]Lucian Ilie, Arto Salomaa:
On the Expressiveness of Subset-Sum Representations. Acta Informatica 36(8): 665-672 (2000) - [j146]Lucian Ilie, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
On strongly context-free languages. Discret. Appl. Math. 103(1-3): 153-165 (2000) - [j145]Arto Salomaa:
Depth of Functional Compositions. Bull. EATCS 71: 143-150 (2000) - [j144]Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Membrane Computing with External Output. Fundam. Informaticae 41(3): 313-340 (2000) - [j143]Lucian Ilie, Grzegorz Rozenberg, Arto Salomaa:
A characterization of poly-slender context-free languages. RAIRO Theor. Informatics Appl. 34(1): 77-86 (2000) - [j142]Taishin Y. Nishida, Arto Salomaa:
On slender 0L languages. Theor. Comput. Sci. 233(1-2): 279-286 (2000) - [c31]Erzsébet Csuhaj-Varjú, Arto Salomaa:
Networks of Watson-Crick D0L Systems. Words, Languages & Combinatorics 2000: 134-150 - [p15]Rudolf Freund, Alexandru Mateescu, Arto Salomaa:
Algebraic Representations of Regular Array Languages. Finite Versus Infinite 2000: 127-148 - [p14]Arto Salomaa:
Compositions over a Finite Domain: From Completeness to Synchronizable Automata. A Half-Century of Automata Theory 2000: 131-143 - [e13]Arto Salomaa, Derick Wood, Sheng Yu:
A Half-Century of Automata Theory: Celebration and Inspiration. World Scientific 2000, ISBN 981-02-4590-4 [contents]
1990 – 1999
- 1999
- [j141]Arto Salomaa:
Watson-Crick Walks and Roads on DOL Graphs. Acta Cybern. 14(1): 179-192 (1999) - [j140]Alexandru Mateescu, Arto Salomaa:
Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring. Bull. EATCS 68: 134-150 (1999) - [j139]Carlos Martín-Vide, Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa:
Contexts on trajectories. Int. J. Comput. Math. 73(1): 15-36 (1999) - [c30]Arto Salomaa, Sheng Yu:
On the decomposition of finite languages. Developments in Language Theory 1999: 22-31 - [c29]Arto Salomaa:
Caesar and DNA. Views on Cryptology. FCT 1999: 39-53 - [c28]Grzegorz Rozenberg, Arto Salomaa:
DNA Computing: New Ideas and Paradigms. ICALP 1999: 106-118 - [e12]Gheorghe Paun, Arto Salomaa:
Grammatical Models of Multi-Agent Systems. Topics in Computer Mathematics 8, Gordon and Breach Science Publishers 1999, ISBN 90-5699-177-9 [contents] - [r1]William I. Gasarch, Arto Salomaa, Thomas H. Cormen, Lane A. Hemaspaandra, Milena Mihail:
Theoretical Computer Science. Handbook of Discrete and Combinatorial Mathematics 1999 - 1998
- [b9]Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
DNA Computing - New Computing Paradigms. Texts in Theoretical Computer Science. An EATCS Series, Springer 1998, ISBN 978-3-540-64196-4, pp. I-IX, 1-402 - [j138]Lila Kari, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, Sheng Yu:
DNA Computing, Sticker Systems, and Universality. Acta Informatica 35(5): 401-420 (1998) - [j137]Hannu Nurmi, Arto Salomaa:
A comparative overview ofcryptographic voting protocols. Ann. Oper. Res. 84: 29-43 (1998) - [j136]Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Complementarity versus universality: Keynotes of DNA computing. Complex. 4(1): 14-19 (1998) - [j135]Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Simple Splicing Systems. Discret. Appl. Math. 84(1-3): 145-163 (1998) - [j134]Erzsébet Csuhaj-Varjú, Arto Salomaa:
Networks of Language Processors: Parallel Communicating Systems. Bull. EATCS 66: 122-138 (1998) - [j133]Valeria Mihalache, Arto Salomaa:
Language-theoretic aspects of string replication. Int. J. Comput. Math. 66(3-4): 163-177 (1998) - [j132]Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Characterizations of re languages starting from internal contextual languages. Int. J. Comput. Math. 66(3-4): 179-197 (1998) - [j131]Lucian Ilie, Arto Salomaa:
2-Testability and Relabelings Produce Everything. J. Comput. Syst. Sci. 56(3): 253-262 (1998) - [j130]Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa:
Shuffle on Trajectories: Syntactic Constraints. Theor. Comput. Sci. 197(1-2): 1-56 (1998) - [j129]Lucian Ilie, Arto Salomaa:
On Well Quasi Orders of Free Monoids. Theor. Comput. Sci. 204(1-2): 131-152 (1998) - [j128]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) - [c27]Tero Harju, Alexandru Mateescu, Arto Salomaa:
Shuffle on Trajectories: The Schützenberger Product and Related Operations. MFCS 1998: 503-511 - 1997
- [j127]Arto Salomaa:
Conjugate Words, Cuts of the Deck and Cryptographic Protocols. Bull. EATCS 61 (1997) - [j126]Valeria Mihalache, Arto Salomaa:
Lindenmayer and DNA: Watson-Crick D0L Systems. Bull. EATCS 62 (1997) - [j125]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) - [j124]Sorina Dumitrescu, Gheorghe Paun, Arto Salomaa:
Pattern Languages Versus Parallel Communicating Grammar Systems. Int. J. Found. Comput. Sci. 8(1): 67-80 (1997) - [c26]Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa:
Syntactic and Semantic Aspects of Parallelism. Foundations of Computer Science: Potential - Theory - Cognition 1997: 79-105 - [c25]Erzsébet Csuhaj-Varjú, Arto Salomaa:
Networks of Parallel Language Processors. New Trends in Formal Languages 1997: 299-318 - [c24]Alexandru Mateescu, George Daniel Mateescu, Grzegorz Rozenberg, Arto Salomaa:
Shuffle-like Operations on omega-words. New Trends in Formal Languages 1997: 395-411 - [c23]Rudolf Freund, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Watson-Crick finite automata. DNA Based Computers 1997: 297-327 - [c22]Cunsheng Ding, Valtteri Niemi, Ari Renvall, Arto Salomaa:
TWOPRIME: A Fast Stream Ciphering Algorithm. FSE 1997: 88-102 - [p13]Alexandru Mateescu, Arto Salomaa:
Formal Languages: an Introduction and a Synopsis. Handbook of Formal Languages (1) 1997: 1-39 - [p12]Jürgen Dassow, Gheorghe Paun, Arto Salomaa:
Grammars with Controlled Derivations. Handbook of Formal Languages (2) 1997: 101-154 - [p11]Alexandru Mateescu, Arto Salomaa:
Aspects of Classical Language Theory. Handbook of Formal Languages (1) 1997: 175-251 - [p10]Lila Kari, Grzegorz Rozenberg, Arto Salomaa:
L Systems. Handbook of Formal Languages (1) 1997: 253-328 - [p9]Gheorghe Paun, Arto Salomaa:
Families Generated by Grammars and L Systems. Handbook of Formal Languages (1) 1997: 811-861 - [e11]Gheorghe Paun, Arto Salomaa:
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 [contents] - [e10]Jan Mycielski, Grzegorz Rozenberg, Arto Salomaa:
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 [contents] - [e9]Grzegorz Rozenberg, Arto Salomaa:
Handbook of Formal Languages, Volume 1: Word, Language, Grammar. Springer 1997, ISBN 978-3-642-63863-3 [contents] - [e8]Grzegorz Rozenberg, Arto Salomaa:
Handbook of Formal Languages, Volume 2. Linear Modeling: Background and Application. Springer 1997, ISBN 978-3-642-08230-6 [contents] - [e7]Grzegorz Rozenberg, Arto Salomaa:
Handbook of Formal Languages, Volume 3: Beyond Words. Springer 1997, ISBN 978-3-642-63859-6 [contents] - 1996
- [b8]Arto Salomaa:
Public Key Cryptography, Second Edition. Texts in Theoretical Computer Science. An EATCS Series, Springer 1996, ISBN 978-3-540-61356-5, pp. I-X, 1-271 - [j123]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-233 (1996) - [j122]Valeria Mihalache, Arto Salomaa:
Growth Functions and Length Sets of Replicating Systems. Acta Cybern. 12(3): 235-247 (1996) - [j121]Lucian Ilie, Arto Salomaa:
On Regular Characterizations of Languages by Grammar Systems. Acta Cybern. 12(4): 411-425 (1996) - [j120]Cunsheng Ding, Arto Salomaa:
On Cooperatively Distributed Ciphering and Hashing. Comput. Artif. Intell. 15(2-3): 233-245 (1996) - [j119]Alexandru Mateescu, Arto Salomaa:
Views on Linguistics. Bull. EATCS 58 (1996) - [j118]Arto Salomaa:
Conjugate Words, Cuts of the Deck and Cryptographic Protocol. Bull. EATCS 59 (1996) - [j117]Marjo Lipponen, Arto Salomaa:
Simple Words in Equality Sets. Bull. EATCS 60: 123-143 (1996) - [j116]Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Contextual Grammars: Parallelism and Blocking of Derivation. Fundam. Informaticae 25(3): 381-397 (1996) - [j115]Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Restricted use of the splicing operation. Int. J. Comput. Math. 60(1-2): 17-32 (1996) - [j114]Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Pattern Grammars. J. Autom. Lang. Comb. 1(3): 219-235 (1996) - [j113]Lila Kari, Gheorghe Paun, Arto Salomaa:
The Power of Restricted Splicing with Rules from a Regular Language. J. Univers. Comput. Sci. 2(4): 224-240 (1996) - [j112]Victor Mitrana, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Pattern Systems. Theor. Comput. Sci. 154(2): 183-201 (1996) - [j111]Taishin Y. Nishida, Arto Salomaa:
Slender 0L Languages. Theor. Comput. Sci. 158(1&2): 161-176 (1996) - [j110]Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Computing by Splicing. Theor. Comput. Sci. 168(2): 321-336 (1996) - [c21]Gheorghe Paun, Arto Salomaa:
From DNA Recombination to DNA Computing, Via Formal Languages. German Conference on Bioinformatics 1996: 93-98 - [c20]Gheorghe Paun, Arto Salomaa:
From DNA Recombination to DNA Computing, Via Formal Languages. German Conference on Bioinformatics - Selected Papers 1996: 210-220 - [e6]Jürgen Dassow, Grzegorz Rozenberg, Arto Salomaa:
Developments in Language Theory II, At the Crossroads of Mathematics, Computer Science and Biology, Magdeburg, Germany, 17-21 July 1995. World Scientific, Singapore 1996 [contents] - 1995
- [j109]Lila Kari, Grzegorz Rozenberg, Arto Salomaa:
Generalised DOL Trees. Acta Cybern. 12(1): 1-9 (1995) - [j108]Gheorghe Paun, Arto Salomaa:
Thin and Slender Languages. Discret. Appl. Math. 61(3): 257-270 (1995) - [j107]Arto Salomaa:
Return to Patterns. Bull. EATCS 55 (1995) - [j106]Arto Salomaa:
From Parikh vectors to GO territories. Bull. EATCS 56 (1995) - [j105]Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu:
P, NP and the Post Correspondence Problem. Inf. Comput. 121(2): 135-142 (1995) - [j104]Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa:
On Parallel Deletions Applied to a Word. RAIRO Theor. Informatics Appl. 29(2): 129-144 (1995) - [j103]Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu:
Decision Problems for Patterns. J. Comput. Syst. Sci. 50(1): 53-63 (1995) - [j102]Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa:
Teams in cooperating grammar systems. J. Exp. Theor. Artif. Intell. 7(4): 347-359 (1995) - [j101]Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Grammars Based on the Shuffle Operation. J. Univers. Comput. Sci. 1(1): 67-81 (1995) - [j100]Erzsébet Csuhaj-Varjú, Gheorghe Paun, Arto Salomaa:
Conditional Tabled Eco-Grammar Systems. J. Univers. Comput. Sci. 1(5): 252-268 (1995) - [j99]Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu:
Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model. J. Univers. Comput. Sci. 1(5): 292-311 (1995) - [j98]Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Parikh Prime Words and GO-like Territories. J. Univers. Comput. Sci. 1(12): 790-810 (1995) - [j97]Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa:
Multi-Pattern Languages. Theor. Comput. Sci. 141(1&2): 253-268 (1995) - 1994
- [b7]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 - [j96]Hannu Nurmi, Arto Salomaa:
Conducting secret ballot elections in computer networks: Problems and solutions. Ann. Oper. Res. 51(4): 185-194 (1994) - [j95]Arto Salomaa:
Patterns. Bull. EATCS 54: 194-206 (1994) - [j94]Alexandru Mateescu, Arto Salomaa:
Finite Degrees of Ambiguity in Pattern Languages. RAIRO Theor. Informatics Appl. 28(3-4): 233-253 (1994) - [j93]Cristian Calude, Hermann A. Maurer, Arto Salomaa:
Journal of Universal Computer Science. J. Univers. Comput. Sci. 0(0): 109-115 (1994) - [c19]Alexandru Mateescu, Arto Salomaa:
Nondeterminism in Patterns. STACS 1994: 661-668 - [p8]Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Marcus Contextual Grammars: Modularity and Leftmost Derivation. Mathematical Aspects of Natural and Formal Languages 1994: 375-392 - [e5]Grzegorz Rozenberg, Arto Salomaa:
Developments in Language Theory, At the Crossroads of Mathematics, Computer Science and Biology, Turku, Finland, 12-15 July 1993. World Scientific, Singapore 1994 [contents] - 1993
- [j92]Alexandru Mateescu, Arto Salomaa:
On Simplest Possible Solutions for Post Correspondence Problems. Acta Informatica 30(5): 441-457 (1993) - [j91]Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun:
Gramars with Oracles. Sci. Ann. Cuza Univ. 2: 3-12 (1993) - [j90]Arto Salomaa:
Simple Reductions Between D0L Language and Sequence Equivalence Problems. Discret. Appl. Math. 41(3): 271-274 (1993) - [j89]Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun:
Deletion Sets. Fundam. Informaticae 19(3/4): 355-370 (1993) - [j88]Jürgen Dassow, Gheorghe Paun, Arto Salomaa:
Grammars Based on Patterns. Int. J. Found. Comput. Sci. 4(1): 1-14 (1993) - [j87]Jürgen Dassow, Gheorghe Paun, Arto Salomaa:
On the Union of 0L Languages. Inf. Process. Lett. 47(2): 59-63 (1993) - [j86]Alexandru Mateescu, Arto Salomaa:
PCP-Prime Words and Primality Types. RAIRO Theor. Informatics Appl. 27(1): 57-70 (1993) - [j85]Mircea Andrasiu, Gheorghe Paun, Jürgen Dassow, Arto Salomaa:
Language-theoretic problems arising from Richelieu cryptosystems. Theor. Comput. Sci. 116(2): 339-357 (1993) - [j84]Gheorghe Paun, Arto Salomaa:
Closure Properties of Slender Languages. Theor. Comput. Sci. 120(2): 293-301 (1993) - [c18]Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Contextual Grammars: Erasing, Determinism, One-Side Contexts. Developments in Language Theory 1993: 370-388 - [c17]Cristian Calude, Arto Salomaa:
Algorithmically Coding the Universe. Developments in Language Theory 1993: 472-492 - [c16]Arto Salomaa:
Pattern Languages: Problems of Decidability and Generation. FCT 1993: 121-132 - [c15]Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu:
Inclusion is Undecidable for Pattern Languages. ICALP 1993: 301-312 - [c14]Alexandru Mateescu, Arto Salomaa:
Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes. MFCS 1993: 174-184 - [p7]Arto Salomaa:
Formal Language Theory. Current Trends in Theoretical Computer Science 1993: 549-550 - [p6]Lila Kari, Solomon Marcus, Gheorghe Paun, Arto Salomaa:
In the prehistory of formal language theory: Gauss languages. Current Trends in Theoretical Computer Science 1993: 551-562 - [p5]Arto Salomaa:
What Emil said about the Post Correspondence Problem. Current Trends in Theoretical Computer Science 1993: 563-571 - [p4]Arto Salomaa:
Decidability in Finite Automata. Current Trends in Theoretical Computer Science 1993: 572-578 - [p3]Arto Salomaa:
L codes and L Systems with immigration. Current Trends in Theoretical Computer Science 1993: 595-602 - [e4]Grzegorz Rozenberg, Arto Salomaa:
Current Trends in Theoretical Computer Science - Essays and Tutorials. World Scientific Series in Computer Science 40, World Scientific 1993, ISBN 978-981-02-1462-3, pp. 1-640 [contents] - 1992
- [j83]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-253 (1992) - [j82]Lila Kari, Solomon Marcus, Gheorghe Paun, Arto Salomaa:
In the prehistory of formal language theory: Gauss Languages. Bull. EATCS 46: 124-139 (1992) - [j81]Gheorghe Paun, Arto Salomaa:
Decision Problems Concerning the Thinness of DOL Languages. Bull. EATCS 46: 171-181 (1992) - [j80]Arto Salomaa:
What Emil said about the Post correspondance problem. Bull. EATCS 47: 154-165 (1992) - [j79]Juha Honkala, Arto Salomaa:
Characterization results about L codes. RAIRO Theor. Informatics Appl. 26: 287-301 (1992) - 1991
- [j78]Hannu Nurmi, Arto Salomaa, Lila Santean:
Secret ballot elections in computer networks. Comput. Secur. 10(6): 553-560 (1991) - [j77]Arto Salomaa:
Preface. Discret. Appl. Math. 32(2): 83 (1991) - [j76]Arto Salomaa:
L Codes and L Systems with Immigration. Bull. EATCS 43: 124-130 (1991) - [j75]Arto Salomaa, Kai Salomaa, Sheng Yu:
Primary Types of Instances of the Post Correspondence Problem. Bull. EATCS 44: 226-241 (1991) - [j74]Arto Salomaa:
Many aspects of formal languages. Inf. Sci. 57-58: 119-129 (1991) - [j73]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Bounded Delay L Codes. Theor. Comput. Sci. 84(2): 265-279 (1991) - [j72]Arto Salomaa:
A Deterministic Algorithm for Modular Knapsack Problems. Theor. Comput. Sci. 88(1): 127-138 (1991) - [c13]Arto Salomaa:
Verifying and Recasting Secret Ballots in Computer Networks. New Results and New Trends in Computer Science 1991: 283-289 - [c12]Juha Honkala, Arto Salomaa:
L Morphisms: Bounded Delay and Regularity of Ambiguity. ICALP 1991: 566-574 - 1990
- [b6]Arto Salomaa:
Public-Key Cryptography. EATCS Monographs on Theoretical Computer Science 23, Springer 1990, ISBN 978-3-662-02629-8, pp. I-X, 1-247 - [j71]Arto Salomaa:
Decision problems arising from knapsack transformations. Acta Cybern. 9(4): 419-440 (1990) - [j70]Arto Salomaa:
Decidability in finite automata. Bull. EATCS 41: 175-183 (1990) - [j69]Arto Salomaa, Lila Santean:
Secret Selling of Secrets with Several Buyers. Bull. EATCS 42: 178-186 (1990) - [p2]Arto Salomaa:
Formal Languages and Power Series. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 103-132
1980 – 1989
- 1989
- [j68]Arto Salomaa:
The Formal Language Theory Column. Bull. EATCS 38: 107-122 (1989) - [p1]Arto Salomaa:
Public-Key Cryptosystems and Language Theory. A Perspective in Theoretical Computer Science 1989: 257-266 - 1988
- [j67]Arto Salomaa:
A public-key cryptosystem based on language theory. Comput. Secur. 7(1): 83-87 (1988) - [j66]Arto Salomaa, Juhani Karhumäki:
The Formal Language Theory Column. Bull. EATCS 34: 82-96 (1988) - [j65]Arto Salomaa:
The formal language theory column. Bull. EATCS 35: 82-96 (1988) - [j64]Arto Salomaa:
The Formal Language Theory Column. Bull. EATCS 36: 85-95 (1988) - [j63]Arto Salomaa:
A Pumping Result for 2-Context-Free Languages. Theor. Comput. Sci. 62(3): 267-287 (1988) - [c11]Arto Salomaa:
Cryptography and Data Security. IMYCS 1988: 220-244 - [e3]Timo Lepistö, Arto Salomaa:
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 [contents] - 1987
- [b5]Arto Salomaa:
Formal languages. Computer science classics, Academic Press 1987, ISBN 978-0-12-615750-5, pp. I-XIII, 1-322 - [j62]Arto Salomaa:
Formal Language Theory Column - Two-way Thue. Bull. EATCS 32: 82-87 (1987) - [j61]Arto Salomaa:
The formal Language Theory Column. Bull. EATCS 33: 42-53 (1987) - 1986
- [b4]Grzegorz Rozenberg, Arto Salomaa:
The book of L. Springer 1986, ISBN 978-3-540-16022-9, pp. I-XV, 1-471 - [b3]Werner Kuich, Arto Salomaa:
Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science 5, Springer 1986, ISBN 3-540-13716-5, pp. I-IX, 1-374 - [j60]Efim B. Kinber, Arto Salomaa, Sheng Yu:
On the equivalence of grammars inferred from derivation. Bull. EATCS 29: 39-45 (1986) - [j59]Karel Culík II, Jozef Gruska, Arto Salomaa:
Systolic Trellis Automata: Stability, Decidability and Complexity. Inf. Control. 71(3): 218-230 (1986) - [j58]Arto Salomaa:
On a Public-Key Cryptosystem Based on Iterated Morphisms and Substitutions. Theor. Comput. Sci. 48(3): 283-296 (1986) - 1985
- [j57]Arto Salomaa:
The Ehrenfeucht conjecture: a proof for language theorists. Bull. EATCS 27: 71-82 (1985) - [j56]Helmut Jürgensen, Arto Salomaa:
Syntactic monoids in the construction of systolic tree automata. Int. J. Parallel Program. 14(1): 35-49 (1985) - 1984
- [j55]Karel Culík II, Arto Salomaa, Derick Wood:
Systolic Tree Acceptors. RAIRO Theor. Informatics Appl. 18(1): 53-69 (1984) - 1983
- [j54]Karel Culík II, Arto Salomaa:
Ambiguity and Decision Problems Concerning Number Systems. Inf. Control. 56(3): 139-153 (1983) - [j53]Hermann A. Maurer, Arto Salomaa, Derick Wood:
A Supernormal-Form Theorem for Context-Free Grammars. J. ACM 30(1): 95-102 (1983) - [j52]Hermann A. Maurer, Arto Salomaa, Derick Wood:
L Codes and Number Systems. Theor. Comput. Sci. 22: 331-346 (1983) - [j51]Karel Culík II, Jozef Gruska, Arto Salomaa:
On a Family of L Languages Resulting from Systolic Tree Automata. Theor. Comput. Sci. 23: 231-242 (1983) - [c10]Karel Culík II, Arto Salomaa:
Ambiguity and Decision Problems Concerning Number Systems. ICALP 1983: 137-146 - 1982
- [j50]Karel Culík II, Jozef Gruska, Arto Salomaa:
Systolic Automata for VLSI on Balanced Trees. Acta Informatica 18: 335-344 (1982) - [j49]Karel Culík II, Faith E. Fich, Arto Salomaa:
A homomorphic characterization of regular languages. Discret. Appl. Math. 4(2): 149-152 (1982) - [j48]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Dense Hierarchies of Grammatical Families. J. ACM 29(1): 118-126 (1982) - [j47]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Finitary and Infinitary Interpretations of Languages. Math. Syst. Theory 15(3): 251-265 (1982) - [j46]Karel Culík II, Arto Salomaa:
On Infinite Words Obtained by Iterating Morphisms. Theor. Comput. Sci. 19: 29-38 (1982) - 1981
- [j45]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Colorings and interpretations: a connection between graphs and grammar forms. Discret. Appl. Math. 3(2): 119-135 (1981) - [j44]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Decidability and density in two-symbol grammar forms. Discret. Appl. Math. 3(4): 289-299 (1981) - [j43]Grzegorz Rozenberg, Arto Salomaa:
Table systems with unconditional transfer. Discret. Appl. Math. 3(4): 319-322 (1981) - [j42]Hermann A. Maurer, Arto Salomaa, Derick Wood:
On Predecessors of Finite Languages. Inf. Control. 50(3): 259-275 (1981) - [j41]Thomas Ottmann, Arto Salomaa, Derick Wood:
Sub-Regular Grammar Forms. Inf. Process. Lett. 12(4): 184-187 (1981) - [j40]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Synchronized EOL Forms Under Uniform Interpretation. RAIRO Theor. Informatics Appl. 15(4): 337-353 (1981) - [j39]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Completeness of Context-Free Grammar Forms. J. Comput. Syst. Sci. 23(1): 1-10 (1981) - [j38]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Uniform Interpretations of Grammar Forms. SIAM J. Comput. 10(3): 483-502 (1981) - 1980
- [j37]Hermann A. Maurer, Arto Salomaa, Derick Wood:
On Generators and Generative Capacity of EOL Forms. Acta Informatica 13: 87-107 (1980) - [j36]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Pure Grammars. Inf. Control. 44(1): 47-72 (1980) - [j35]Hermann A. Maurer, Arto Salomaa, Derick Wood:
MSW Spaces. Inf. Control. 46(3): 187-199 (1980) - [j34]Karel Culík II, Arto Salomaa:
Test Sets and Checking Words for Homomorphism Equivalence. J. Comput. Syst. Sci. 20(3): 379-395 (1980) - [j33]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Context-Free Grammar Forms with Strict Interpretations. J. Comput. Syst. Sci. 21(1): 110-135 (1980) - [j32]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Synchronized E0L Forms. Theor. Comput. Sci. 12: 135-159 (1980) - [c9]Arto Salomaa:
Grammatical Families. ICALP 1980: 543-554
1970 – 1979
- 1979
- [j31]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Context-Dependent L Forms. Inf. Control. 42(1): 97-118 (1979) - [j30]Hermann A. Maurer, Grzegorz Rozenberg, Arto Salomaa, Derick Wood:
Pure interpretations for EOL forms. RAIRO Theor. Informatics Appl. 13(1): 347-362 (1979) - [j29]Hermann A. Maurer, Martti Penttonen, Arto Salomaa, Derick Wood:
On Non Context-Free Grammar Forms. Math. Syst. Theory 12: 297-324 (1979) - [c8]Arto Salomaa:
Power from Power Series. MFCS 1979: 170-181 - 1978
- [b2]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 - [b1]Arto Salomaa:
Formale Sprachen. Springer 1978, ISBN 978-3-540-09030-4, pp. I-XI, 1-314 - [j28]Arto Salomaa:
Equality sets for homomorphisms of free monoids. Acta Cybern. 4(1): 127-139 (1978) - [j27]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Uniform Interpretations of L Forms. Inf. Control. 36(2): 157-173 (1978) - [j26]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Relative Goodness for EOL Forms. RAIRO Theor. Informatics Appl. 12(4): 291-304 (1978) - [j25]Hermann A. Maurer, Arto Salomaa, Derick Wood:
ETOL Forms. J. Comput. Syst. Sci. 16(3): 345-361 (1978) - [j24]Karel Culík II, Arto Salomaa:
On the Decidability of Homomorphism Equivalence for Languages. J. Comput. Syst. Sci. 17(2): 163-175 (1978) - [j23]Hermann A. Maurer, Arto Salomaa, Derick Wood:
On Good E0L Forms. SIAM J. Comput. 7(2): 158-166 (1978) - [j22]Karel Culík 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
- [j21]Hermann A. Maurer, Arto Salomaa, Derick Wood:
EOL Forms. Acta Informatica 8: 75-96 (1977) - [j20]Grzegorz Rozenberg, Arto Salomaa:
New squeezing mechanisms for L systems. Inf. Sci. 12(3): 187-201 (1977) - [j19]Hermann A. Maurer, Thomas Ottmann, Arto Salomaa:
On the Form Equivalence of L-Forms. Theor. Comput. Sci. 4(2): 199-225 (1977) - [j18]Grzegorz Rozenberg, Martti Penttonen, Arto Salomaa:
Bibliography of L Systems. Theor. Comput. Sci. 5(3): 339-354 (1977) - [e2]Arto Salomaa, Magnus Steinby:
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 [contents] - 1976
- [j17]Arto Salomaa:
Undecidable Problems Concerning Growth in Informationless Lindenmayer Systems. J. Inf. Process. Cybern. 12(7): 331-335 (1976) - [j16]Grzegorz Rozenberg, Arto Salomaa:
Context-Free Grammars with Graph-Controlled Tables. J. Comput. Syst. Sci. 13(1): 90-99 (1976) - [c7]Arto Salomaa:
Recent Results on L Systems. MFCS 1976: 115-123 - 1975
- [c6]Arto Salomaa:
Growth Functions of Lindenmayer Systems: Some New Approaches. Automata, Languages, Development 1975: 271-282 - [c5]Arto Salomaa:
Formal Power Series and Growth Functions of Lindenmayer Systems. MFCS 1975: 101-113 - 1974
- [j15]Mogens Nielsen, Grzegorz Rozenberg, Arto Salomaa, Sven Skyum:
Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. II. Nondeterministic Systems. Acta Informatica 3: 357-364 (1974) - [j14]Mogens Nielsen, Grzegorz Rozenberg, Arto Salomaa, Sven Skyum:
Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. I. Deterministic Systems. Acta Informatica 4: 87-106 (1974) - [j13]Arto Salomaa:
Solution of a decision problem concerning unary Lindenmayer systems. Discret. Math. 9(1): 71-77 (1974) - [c4]Arto Salomaa:
Iteration Grammars and Lindenmayer AFL's. L Systems 1974: 250-253 - [c3]Arto Salomaa:
Parallelism in Rewriting Systems. ICALP 1974: 523-533 - [e1]Grzegorz Rozenberg, Arto Salomaa:
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 [contents] - 1973
- [j12]Arto Salomaa:
On Sentential Forms of Context-Free Grammars. Acta Informatica 2: 40-49 (1973) - [j11]Azaria Paz, Arto Salomaa:
Integral Sequential Word Functions and Growth Equivalence of Lindenmayer Systems. Inf. Control. 23(4): 313-343 (1973) - [c2]Arto Salomaa:
On some recent problems concerning developmental languages. Automatentheorie und Formale Sprachen 1973: 23-34 - [c1]Arto Salomaa:
L-Systems: A Device in Biologically Motivated Automata Theory. MFCS 1973: 147-151 - 1972
- [j10]Arto Salomaa:
Matrix Grammars with a Leftmost Restriction. Inf. Control. 20(2): 143-149 (1972) - 1971
- [j9]Arto Salomaa:
The Generative Capacity of Transformational Grammars of Ginsburg and Partee. Inf. Control. 18(3): 227-232 (1971) - 1970
- [j8]Arto Salomaa:
Periodically Time-Variant Context-Free Grammars. Inf. Control. 17(3): 294-311 (1970)
1960 – 1969
- 1969
- [j7]Arto Salomaa:
On the Index of a Context-Free Grammar and Language. Inf. Control. 14(5): 474-477 (1969) - [j6]Arto Salomaa:
Probabilistic and Weighted Grammars. Inf. Control. 15(6): 529-544 (1969) - 1968
- [j5]Arto Salomaa:
On Finite Automata with a Time-Variant Structure. Inf. Control. 13(2): 85-98 (1968) - [j4]Arto Salomaa:
On Regular Expressions and Regular Canonical Systems. Math. Syst. Theory 2(4): 341-355 (1968) - 1967
- [j3]Arto Salomaa:
On m-adic Probabilistic Automata. Inf. Control. 10(2): 215-219 (1967) - 1966
- [j2]Arto Salomaa:
Two Complete Axiom Systems for the Algebra of Regular Events. J. ACM 13(1): 158-169 (1966) - 1960
- [j1]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)
Coauthor Index
Lila Kari
aka: Lila Santean
aka: Lila Santean
[e37] [j207] [j205] [e33] [e29] [j187] [e27] [e26] [e24] [j176] [e23] [e22] [e21] [e20] [e19] [j162] [e18] [j151] [e15] [e14] [j146] [j144] [e12] [b9] [j138] [j136] [j135] [j132] [j128] [j124] [c23] [p12] [p9] [e11] [j123] [j116] [j115] [j114] [j113] [j112] [j110] [c21] [c20] [j108] [j104] [j102] [j101] [j100] [j98] [j97] [p8] [j91] [j89] [j88] [j87] [j85] [j84] [c18] [p6] [j83] [j82] [j81]
[j211] [e39] [j210] [e38] [e37] [e36] [j207] [j205] [e35] [e34] [j201] [e33] [e32] [e31] [e30] [j189] [e29] [j187] [e28] [e27] [e26] [e24] [e23] [e22] [e21] [e20] [e19] [e18] [j153] [j151] [e16] [e15] [e14] [j146] [j144] [j143] [j139] [c28] [b9] [j138] [j136] [j135] [j132] [j130] [j125] [c26] [c24] [c23] [p10] [e10] [e9] [e8] [e7] [j123] [j116] [j115] [j114] [j112] [j110] [e6] [j109] [j101] [j98] [b7] [p8] [e5] [c18] [e4] [b4] [j43] [j30] [j20] [j18] [j16] [j15] [j14] [e1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
