Informatique Théorique et Applications, Volume 33, 1999

Volume 33, Number 1, January/February 1999

• Rafael C. Carrasco, José Oncina: Learning deterministic regular grammars from stochastic samples in polynomial time. 1-20 BibTeX
• Christoph Meinel, Thorsten Theobald: On the Influence of the State Encoding on OBDD-Representations of Finite State Machines. 21-32 BibTeX
• Maria J. Serna, Fatos Xhafa: On the Average Case Complexity of Some P-complete Problems. 33-46 BibTeX
• Carla Selmi: Strongly locally testable semigroups with commuting idempotents and related languages. 47-58 BibTeX
• Ines Abdeljaouad: Calculs d'invariants primitifs de groupes finis. 59-78 BibTeX
• Christiane Frougny: On-line finite automata for addition in some numeration systems. 79-101 BibTeX

Volume 33, Number 2, March/April 1999

• Beate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener: On the complexity of the hidden weighted bit function for various BDD models. 103-116 BibTeX
• Vesa Halava, Tero Harju: Undecidability of the equivalence of finite substitutions on regular language. 117-124 BibTeX
• Juha Honkala: On sequences defined by D0L power series. 125-132 BibTeX
• Roman R. Redziejowski: Construction of a deterministic -automaton using derivatives. 133-158 BibTeX
• Jörg Rothe: Immunity and simplicity for exact counting and other counting classes. 159-176 BibTeX
• Rudolf Grübel: On the median-of-K version of Hoare's selection algorithm. 177-192 BibTeX
• Juraj Hromkovic: Communication complexity and lower bounds on multilective computations. 193-212 BibTeX

Volume 33, Number 3, May/June 1999

• Phan Trung Huy, Nguyen Huong Lam: Unavoidable set: extension and reduction. 213-226 BibTeX
• Anne Preller, P. Duroux: Normalisation of the Theory T of Cartesian Closed Categories and Conservativity of Extensions T[x] of T. 227-258 BibTeX
• Bernd Borchert, Dietrich Kuske, Frank Stephan: On existentially first-order definable languages and their relation to NP. 259-270 BibTeX
• Andrzej Szepietowski: There is no complete axiom system for shuffle expressions. 271-278 BibTeX
• Alfons Geser, Hans Zantema: Non-looping string rewriting. 279-302 BibTeX
• Andrzej Szepietowski: Lower space bounds for accepting shuffle languages. 303-307 BibTeX

Volume 33, Number 4/5, July/October 1999

• Ralph Matthes: Monotone (co)inductive types and positive fixed-point types. 309-328 BibTeX
• André Arnold: p329 The µ-calculus alternation-depth hierarchy is strict on binary trees. 329-340 BibTeX
• Julian C. Bradfield: Fixpoint alternation: Arithmetic, transition systems, and the binary tree. 341-356 BibTeX
• Jennifer M. Davoren: Topologies, continuity and bisimulations. 357-382 BibTeX
• Dilian Gurov, Bruce M. Kapron: A note on negative tagging for least fixed-point formulae. 383-392 BibTeX
• Jan J. M. M. Rutten: A note on coinduction and weak bisimilarity for while programs. 393-400 BibTeX
• Roland Carl Backhouse, Paul F. Hoogendijk: Final dialgebras: From categories to allegories. 401-426 BibTeX
• Helmut Seidl, Damian Niwinski: On distributive fixed-point expressions. 427-446 BibTeX
• Flavio Corradini, Rocco De Nicola, Anna Labella: A finite axiomatization of nondeterministic regular expressions. 447-466 BibTeX
• Andrea Corradini, Fabio Gadducci: Rewriting on cyclic structures: Equivalence between the operational and the categorical description. 467-493 BibTeX

Volume 33, Number 6, November/December 1999

• Olivier Carton, Ramón Maceiras: Computing the Rabin Index of a Parity Automaton. 495-506 BibTeX
• Luca Paolini, Simona Ronchi Della Rocca: Call-by-value Solvability. 507-534 BibTeX
• Kenichi Morita, Maurice Margenstern, Katsunobu Imai: Universality of Reversible Hexagonal Cellular Automata. 535-550 BibTeX