Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 658
Volume 658, Part A, January 2017
- Dora Giammarresi, Sabrina Mantaci, Marinella Sciortino, Filippo Mignosi:
Preface. 1-3
- Marcella Anselmo, Maria Madonia:
Two-dimensional comma-free and cylindric codes. 4-17 - Marie-Pierre Béal, Pavel Heller:
Shifts of k-nested sequences. 18-26 - Golnaz Badkobeh, Maxime Crochemore
, Robert Mercas:
Counting maximal-exponent factors in words. 27-35 - Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani:
Non-overlapping matrices. 36-45 - Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro:
A logical characterization of timed regular languages. 46-59 - Paola Bonizzoni, Anna Paola Carrieri, Gianluca Della Vedova, Raffaella Rizzi, Gabriella Trucco:
A colored graph approach to perfect phylogeny with persistent characters. 60-73 - Giusi Castiglione, Paolo Massazza:
On a class of languages with holonomic generating functions. 74-84 - Christian Choffrut:
Sequences of words defined by two-way transducers. 85-96 - Robert Cori, Christophe Reutenauer:
On Sillke's bijection. 97-104 - Stefano Crespi-Reghizzi, Violetta Lonati, Dino Mandrioli, Matteo Pradella:
Toward a theory of input-driven locally parsable languages. 105-121 - Alma D'Aniello, Aldo de Luca, Alessandro De Luca:
On Christoffel and standard words and their derivatives. 122-147 - Clelia De Felice, Rocco Zaccagnino, Rosalba Zizza:
Unavoidable sets and circular splicing languages. 148-158 - Francesco Dolce, Dominique Perrin:
Neutral and tree sets of arbitrary characteristic. 159-174 - Giovanna Guaiana:
Local testability from words to traces, a suitable definition. 175-189 - Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland:
On cardinalities of k-abelian equivalence classes. 190-204 - Jetty Kleijn, Maciej Koutny, Marta Pietkiewicz-Koutny, Grzegorz Rozenberg:
Applying regions. 205-215 - Victor Marsault, Jacques Sakarovitch:
The signature of rational languages. 216-234 - Nelma Moreira, Giovanni Pighizzini, Rogério Reis:
Optimal state reductions of automata with partially specified behaviors. 235-245 - Jean-Éric Pin, Pedro V. Silva:
On uniformly continuous functions for some profinite topologies. 246-262
Volume 658, Part B, January 2017
- Kira V. Adaricheva, Giuseppe F. Italiano, Hans Kleine Büning, György Turán:
Foreword. 263
- Marcel Wild:
The joy of implications, aka pure Horn formulas: Mainly a survey. 264-292 - Giorgio Ausiello, Luigi Laura:
Directed hypergraphs: Introduction and fundamental algorithms - A survey. 293-306 - Kira V. Adaricheva, James B. Nation:
Discovery of the D-basis in binary tables based on hypergraph dualization. 307-315 - Mikhail A. Babin, Sergei O. Kuznetsov:
Dualization in lattices given by ordered sets of irreducibles. 316-326 - Sebastian Rudolph:
Succinctness and tractability of closure operator representations. 327-345 - Marta Arias, José L. Balcázar, Cristina Tîrnauca:
Learning definite Horn formulas from closure queries. 346-356 - Brice Chardin, Emmanuel Coquery, Marie Pailloux, Jean-Marc Petit:
RQL: A Query Language for Rule Discovery in Databases. 357-374 - Sergei Obiedkov:
Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics. 375-390 - Laurent Beaudou, Arnaud Mary, Lhouari Nourine:
Algorithms for k-meet-semidistributive lattices. 391-398 - Petr Kucera:
Hydras: Complexity on general graphs and a subclass of trees. 399-416 - Robert H. Sloan, Despina Stasi, György Turán:
Hydras: Directed hypergraphs and Horn formulas. 417-428
a service of 
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 2024-04-19 19: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:
