default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 429
Volume 429, April 2012
- Giorgio Ausiello, Hendrik Jan Hoogeboom, Juhani Karhumäki, Ion Petre
, Arto Salomaa:
Preface. 1-20
- Maurice H. ter Beek, Jetty Kleijn:
Vector team automata. 21-29 - Hans L. Bodlaender, Jurriaan Hage:
On switching classes, NLC-width, cliquewidth and treewidth. 30-35 - Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi:
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters. 36-45 - Robert Brijder, Joris J. M. Gillis, Jan Van den Bussche:
A comparison of graph-theoretic DNA hybridization models. 46-53 - Mark Daley, Helmut Jürgensen, Lila Kari, Kalpana Mahalingam:
Relativized codes. 54-64 - Volker Diekert, Steffen Kopecki:
Language theoretical properties of hairpin formations. 65-73 - Pierluigi Frisco, Gordon Govan, Alberto Leporati:
Asynchronous P systems with active membranes. 74-86 - Karsten Gabriel, Hartmut Ehrig:
Modelling evolution of communication platforms and scenarios based on transformations of high-level nets and processes. 87-97 - Yuan Gao, Lila Kari, Sheng Yu:
State complexity of union and intersection of star on k regular languages. 98-107 - Daniela Genova, Natasa Jonoska:
Forbidding and enforcing on graphs. 108-117 - David Harel, Amir Kantor:
Multi-modal scenarios revisited: A net-based representation. 118-127 - Tero Harju:
Square-free words obtained from prefixes by permutations. 128-133 - Mika Hirvensalo:
On probabilistic and quantum reaction systems. 134-143 - Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada:
On the approximability and hardness of minimum topic connected overlay and its special instances. 144-154 - Oscar H. Ibarra, Hsu-Chun Yen:
On the containment and equivalence problems for two-way transducers. 155-163 - Masami Ito:
Algebraic structures of automata. 164-168 - Kurt Jensen, Lars Michael Kristensen, Thomas Mailund:
The sweep-line state space exploration method. 169-179 - Jarkko Kari:
Universal pattern generation by cellular automata. 180-184 - Jetty Kleijn, Maciej Koutny:
Localities in systems with a/sync communication. 185-192 - Hans-Jörg Kreowski, Sabine Kuske:
Polynomial graph transformability. 193-201 - Jan van Leeuwen, Jirí Wiedermann:
Computation as an unbounded process. 202-212 - Luca Manzoni, Leonardo Vanneschi, Giancarlo Mauri:
A distance between populations for one-point crossover in genetic algorithms. 213-221 - Hermann A. Maurer:
A linear ordering of a multi-parameter universe is usually nonsense. 222-226 - Antoni W. Mazurkiewicz:
Petri net languages revisited. 227-235 - Mogens Nielsen, Karl Krukow:
Transfer of trust in event-based reputation systems. 236-246 - Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori:
Reaction automata. 247-257 - Gheorghe Paun, Mario J. Pérez-Jiménez:
Towards bridging two cell-inspired models: P systems and R systems. 258-264 - Dominique Perrin, Antonio Restivo:
A note on Sturmian words. 265-272 - Xiaoxue Piao, Kai Salomaa:
State complexity of the concatenation of regular tree languages. 273-281 - Antonio Restivo, Roberto Vaglica:
A graph theoretic approach to automata minimality. 282-291 - P. S. Thiagarajan, Shaofa Yang:
Modular discrete time approximations of distributed hybrid automata. 292-304
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.
last updated on 2025-02-21 19:35 CET 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:
