default search action
Fundamenta Informaticae, Volume 110
Volume 110, Numbers 1-4, 2011
- Juhani Karhumäki, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Preface. - Ali Akhtarzada, Cristian S. Calude, John G. Hosking:
A Multi-Criteria Metric Algorithm for Recommender Systems. 1-11 - Artiom Alhazov, Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan:
P Systems with Insertion and Deletion Exo-Operations. 13-28 - Sepinoud Azimi, Tero Harju, Miika Langille, Ion Petre, Vladimir Rogojin:
Directed Overlap-inclusion Graphs as Representations of Ciliate Genes. 29-44 - Alexis Ballier, Pierre Guillon, Jarkko Kari:
Limit Sets of Stable and Unstable Cellular Automata. 45-57 - Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock:
On the Hardness of Reoptimization with Multiple Given Solutions. 59-76 - Paola Bonizzoni, Claudio Ferretti, Anthonath Roslin Sagaya Mary, Giancarlo Mauri:
Picture Languages Generated by Assembling Tiles. 77-93 - Cewei Cui, Zhe Dang, Thomas R. Fischer:
Typical Paths of a Graph. 95-109 - Ömer Egecioglu, László Hegedüs, Benedek Nagy:
Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages. 111-123 - Gerry Eisman, Bala Ravikumar:
On Approximating Non-regular Languages by Regular Languages. 125-142 - Yuan Gao, Kai Salomaa, Sheng Yu:
Transition Complexity of Incomplete DFAs. 143-158 - Markus Holzer, Andreas Klein, Martin Kutrib, Oliver Ruepp:
Computational Complexity of NURIKABE. 159-174 - Juha Honkala:
The Sequence Equivalence Problem for Marked DT0L Systems. 175-182 - Lucian Ilie, William F. Smyth:
Minimum Unique Substrings and Maximum Repeats. 183-195 - Juhani Karhumäki, Aleksi Saarela:
The Unique Decipherability in the Monoid of Regular Languages is Undecidable. 197-200 - Lila Kari, Shinnosuke Seki, Steffen Kopecki:
On the Regularity of Iterated Hairpin Completion of a Single Word. 201-215 - Jetty Kleijn, Maciej Koutny:
Membrane Systems with Qualitative Evolution Rules. 217-230 - Michal Kunc, Alexander Okhotin:
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata. 231-239 - Kenichi Morita:
Two-Way Reversible Multi-Head Finite Automata. 241-254 - Fumiya Okubo, Takashi Yokomori:
On the Hairpin Incompletion. 255-269 - Linqiang Pan, Jun Wang, Hendrik Jan Hoogeboom:
Limited Asynchronous Spiking Neural P Systems. 271-293 - Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Miquel Rius-Font, Francisco José Romero-Campero:
Looking for Small Efficient P Systems. 295-308 - Rama Raghavan, H. Ramesh, Marian Gheorghe, Shankara Narayanan Krishna:
On Restricted Bio-Turing Machines. 309-320 - Nicholas Q. Tran:
Characterizations and Existence of Easy Sets without Hard Subsets. 321-328 - Sergey Verlan, Maurice Margenstern:
Universality of Splicing Test Tube Systems with Two Tubes. 329-342 - Hsu-Chun Yen:
On Almost-Sure Properties of Probabilistic Discrete Event Systems. 343-359
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.