Theoretical Computer Science, Volume 658
Volume 658, Part A, January 2017
- Golnaz Badkobeh, Maxime Crochemore, Robert Mercas:
Counting maximal-exponent factors in words. 27-35 - 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 - 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 - 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 - 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
- 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 - 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 - Robert H. Sloan, Despina Stasi, György Turán:
Hydras: Directed hypergraphs and Horn formulas. 417-428