default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 454
Volume 454, October 2012
- Grzegorz Rozenberg:
Preface. 1 - Grzegorz Rozenberg, Arto Salomaa:
Preface. 2-4
- Angela Angeleska, Natasa Jonoska, Masahico Saito:
Rewriting rule chains modeling DNA rearrangement pathways. 5-22 - Alberto Apostolico, Péter L. Erdös, Alpár Jüttner:
Parameterized searching with mismatches for run-length encoded strings. 23-29 - Sepinoud Azimi
, Tero Harju, Miika Langille, Ion Petre:
Simple gene assembly as a rewriting of directed overlap-inclusion graphs. 30-37 - Franziska Biegler, Mark Daley, Ian McQuillan:
Algorithmic decomposition of shuffle on words. 38-50 - Paola Bonizzoni, Chiara Braghin, Riccardo Dondi, Gabriella Trucco:
The binary perfect phylogeny with persistent characters. 51-63 - Robert Brijder, Tero Harju, Hendrik Jan Hoogeboom:
Pivots, determinants, and perfect matchings of graphs. 64-71 - Cristian S. Calude, Elena Calude, Melissa S. Queen:
The complexity of Euler's integer partition theorem. 72-80 - Ehsan Chiniforooshan, Mark Daley, Oscar H. Ibarra, Lila Kari, Shinnosuke Seki:
One-reversal counter machines and multihead automata: Revisited. 81-87 - Christian Choffrut, Serge Grigorieff:
Rational relations having a rational trace on each finite intersection of rational relations. 88-94 - Luca Corolli, Carlo Maj, Fabrizio Marini, Daniela Besozzi, Giancarlo Mauri:
An excursion in reaction systems: From computer science to biology. 95-108 - Aldo de Luca, Alessandro De Luca:
A generalized palindromization map in free monoids. 109-128 - Volker Diekert, Manfred Kufleitner, Pascal Weil:
Star-free languages are Church-Rosser congruential. 129-135 - Harold N. Gabow:
A combinatoric interpretation of dual variables for weighted matching and f-factors. 136-163 - Yuan Gao, Lila Kari, Sheng Yu:
State complexity of union and intersection of square and reversal on k regular languages. 164-171 - Mari Huova, Juhani Karhumäki, Aleksi Saarela:
Problems in between words and abelian words: k-abelian avoidability. 172-177 - Timo Jolivet, Jarkko Kari:
Consistency of multidimensional combinatorial substitutions. 178-188 - Jetty Kleijn, Maciej Koutny, Marta Pietkiewicz-Koutny:
Regions of Petri nets with a/sync connections. 189-198 - Filippo Mignosi, Antonio Restivo:
Characteristic Sturmian words are extremal for the Critical Factorization Theorem. 199-205 - Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori:
On the properties of language classes defined by bounded reaction automata. 206-221 - Gheorghe Paun, Mario J. Pérez-Jiménez:
P automata revisited. 222-230 - Xiaoxue Piao, Kai Salomaa:
Lower bounds for the size of deterministic unranked tree automata. 231-239 - Andrzej Skowron, Piotr Wasilewski:
Interactive information systems: Toward perception based computing. 240-260
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-12-09 23:40 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:
