@article{Watanabe-Watanabe/07,
AUTHOR = {Watanabe, Kazuho and Watanabe, Sumio},
TITLE = {Stochastic complexity for mixture of exponential families in generalized variational Bayes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {1},
PAGES = {4-17},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {mixture model, exponential family, variational bayes, generalized bayes, stochastic complexity, free energy, kullback information, non-regular model},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-3/2/d5bbbb13f4721327f557c31709a6d5d8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Palmer-Goldberg/07,
AUTHOR = {Palmer, Nick and Goldberg, Paul W.},
TITLE = {PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {1},
PAGES = {18-31},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational complexity, machine learning},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-8/2/58bf7c52170033b43175b111f784f6d7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bennet-Bshouty/07,
AUTHOR = {Bennet, Rotem and Bshouty, Nader H.},
TITLE = {Learning attribute-efficiently with corrupt oracles},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {1},
PAGES = {32-50},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {learning, oracles, corrupt, exact, queries, attribute efficient, monotone theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-9/2/4f5d8fc81cecb97f656323b1e61084b0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jain-Lange-Zilles/07a,
AUTHOR = {Jain, Sanjay and Lange, Steffen and Zilles, Sandra},
TITLE = {A general comparison of language learning from examples and from queries},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {1},
PAGES = {51-66},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {inductive inference, query learning, formal languages, recursion theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-4/2/998a74b1533a1cdba916981de5895fe2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jain-Kinber/07a,
AUTHOR = {Jain, Sanjay and Kinber, Efim},
TITLE = {Learning multiple languages in groups},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {1},
PAGES = {67-76},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational learning theory, learning in the limit, classification, learning multiple languages},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-G/2/bea2fb880a763ca1060e5a4ffeade769},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vovk/07,
AUTHOR = {Vovk, Vladimir},
TITLE = {Non-asymptotic calibration and resolution},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {1},
PAGES = {77-89},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {calibration, resolution, k29 algorithm, k29* algorithm, algorithm of large numbers, hilbert space, kernel, reproducing kernel hilbert space, law of large numbers, law of the iterated logarithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-B/2/5e468e9c929f5862b2ff8a7a6c4751a0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Almeida-Moreira-Reis/07,
AUTHOR = {Almeida, Marco and Moreira, Nelma and Reis, Rog{\'e}rio},
TITLE = {Enumeration and generation with a string automata representation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {93-102},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite automata, initially-connected deterministic finite automata, exact enumeration, random generation, minimal automata},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-5/2/f37666af7cf2c1d12dc26dafc379eb58},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Biegler-Burrell-Daley/07,
AUTHOR = {Biegler, Franziska and Burrell, Michael J. and Daley, Mark},
TITLE = {Regulated RNA rewriting: Modelling RNA editing with guided insertion},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {103-112},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {regulated rewriting, rna editing, formal languages, kinetoplasts},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PB0PW1-1/2/f4ac57c804d015ef69e21e48700301a0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Biegler-McQuillan-Salomaa/07,
AUTHOR = {Biegler, Franziska and McQuillan, Ian and Salomaa, Kai},
TITLE = {An infinite hierarchy induced by depth synchronization},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {113-124},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {synchronization, et0l languages, regulated rewriting, infinite hierarchy},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-D/2/f1cf0a864dd42a24f972fa6c14db2265},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cordy-Salomaa/07,
AUTHOR = {Cordy, Brendan and Salomaa, Kai},
TITLE = {On the existence of regular approximations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {125-135},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {regular languages, degree of approximation, decidability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-J/2/8ed722e5b32e611bd6dea7cb01a653f2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dassow-Truthe/07,
AUTHOR = {Dassow, J{\"u}rgen and Truthe, Bianca},
TITLE = {On the number of components for some parallel communicating grammar systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {136-146},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parallel communicating grammar systems, number of components, multiple agreements, crossed agreements and replication},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-F/2/f8fbc47ca072695f357f2a903f86174a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Domaratzki-Salomaa/07,
AUTHOR = {Domaratzki, Michael and Salomaa, Kai},
TITLE = {Transition complexity of language operations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {147-154},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {transition complexity, descriptional complexity, nondeterministic finite automata, regular languages},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-6/2/4886dccd9cc1bae2901ab8a5c6b2cb06},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gruber-Holzer/07,
AUTHOR = {Gruber, Hermann and Holzer, Markus},
TITLE = {On the average state and transition complexity of finite languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {155-166},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite automata, descriptional complexity, average case complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-K/2/de8eb3355a266157c15214e1f0654c47},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gruber-Holzer-Kutrib/07,
AUTHOR = {Gruber, Hermann and Holzer, Markus and Kutrib, Martin},
TITLE = {The size of Higman-Haines sets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {167-176},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite automata, higman's theorem, well-partial order, descriptional complexity, non-recursive trade-offs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-M/2/99d8820ff7f4497511df360328ce3f49},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mereghetti-Palano/07,
AUTHOR = {Mereghetti, Carlo and Palano, Beatrice},
TITLE = {Quantum automata for some multiperiodic languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {177-186},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {quantum automata, periodic languages},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-7/2/78ebed1ef1127fd140f317847cff13e9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Niessner-Ultes-Nitsche/07,
AUTHOR = {Nie{\ss}ner, Frank and Ultes-Nitsche, Ulrich},
TITLE = {A complete characterization of deterministic regular liveness properties},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {187-195},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {model checking, properties, liveness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-N/2/330e8008954b5d722e4d8656fa6191b9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fenwick/07,
AUTHOR = {Fenwick, Peter},
TITLE = {Burrows-Wheeler compression: Principles and reflections},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {200-219},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {burrows-wheeler transform, run encoding, ppm, recovered contexts, erasure channels},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P940TB-6/2/fcf38b43a47e8afcaf82099b72758ebb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kaplan-Landau-Verbin/07,
AUTHOR = {Kaplan, Haim and Landau, Shir and Verbin, Elad},
TITLE = {A simpler analysis of Burrows-Wheeler-based compression},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {220-235},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {text compression, burrows-wheeler transform, distance coding, worst-case analysis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P940TB-4/2/99b5e8f78b0aa6467e449d0fd9323813},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Giancarlo-Restivo-Sciortino/07,
AUTHOR = {Giancarlo, R. and Restivo, A. and Sciortino, M.},
TITLE = {From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {236-248},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {burrows-wheeler transform, optimal word permutation, suffix tree, lyndon word},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P940TB-7/2/45bcbaebb82069db832caf92865fb0a0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Karkkainen/07,
AUTHOR = {K{\"a}rkk{\"a}inen, Juha},
TITLE = {Fast BWT in small space by blockwise suffix sorting},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {249-257},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {burrows-wheeler transform, suffix sorting, suffix array, space-efficient algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P940TB-2/2/546fd4ec627ec782f7492eaa8f155a7b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Larsson-Sadakane/07,
AUTHOR = {Larsson, N. Jesper and Sadakane, Kunihiko},
TITLE = {Faster suffix sorting},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {258-272},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {suffix arrays, burrows-wheeler transform},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-1/2/463bb434972e4e0511eeaf8e3ae3e121},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vo-Vo/07,
AUTHOR = {Vo, Binh Dao and Vo, Kiem-Phong},
TITLE = {Compressing table data with column dependency},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {273-283},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {column dependency, context sorting, table compression},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P940TB-3/2/4d72e32a7f13cb5bf8aa09b7a554f06d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Barbay-Golynski-Munro-Rao/07,
AUTHOR = {Barbay, J{\'e}r{\'e}my and Golynski, Alexander and Munro, J. Ian and Rao, S. Srinivasa},
TITLE = {Adaptive searching in succinctly encoded binary relations and tree-structured documents},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {284-297},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {adaptive algorithms, conjunctive queries, intersection problem, labeled trees, multi-labeled trees, path queries, succinct data structures},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P940TB-5/2/8aadb9bc5bf660e7c48ab7a34353d404},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mantaci-Restivo-Rosone-Sciortino/07,
AUTHOR = {Mantaci, S. and Restivo, A. and Rosone, G. and Sciortino, M.},
TITLE = {An extension of the Burrows-Wheeler Transform},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {298-312},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {burrows-wheeler transform, sequence comparison, alignment-free distance measure},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P940TB-8/2/2660a04815796068822bd34f07b78c14},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gupta-Hon-Shah-Vitter/07a,
AUTHOR = {Gupta, Ankur and Hon, Wing-Kai and Shah, Rahul and Vitter, Jeffrey Scott},
TITLE = {Compressed data structures: Dictionaries and data-aware measures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {313-331},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {dictionary problem, compressed, gap encoding, rank, select, predecessor, bsgap},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PC3SM2-1/2/6f4de6a6cfc766aa520e2b635bd43e59},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Makinen-Navarro/07,
AUTHOR = {M{\"a}kinen, Veli and Navarro, Gonzalo},
TITLE = {Rank and select revisited and extended},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {332-347},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {succinct data structures, compressed data structures, gap encoding, range searching, position-restricted substring searching, wavelet trees, substring rank and select},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P940TB-9/2/80c0d278e0cf07f62f15b95b8e495f2a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Golynski/07,
AUTHOR = {Golynski, Alexander},
TITLE = {Optimal lower bounds for rank and select indexes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {348-359},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {fully indexable dictionary, lower bounds, succinct data structures},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PBDR4H-1/2/54535eb3cee54e6f15eccf6523b573ce},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}