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]