- 1999
- Ines Abdeljaouad:
Calculs d'invariants primitifs de groupes finis. RAIRO Theor. Informatics Appl. 33(1): 59-78 (1999) - André Arnold:
p329 The µ-calculus alternation-depth hierarchy is strict on binary trees. RAIRO Theor. Informatics Appl. 33(4/5): 329-340 (1999) - Roland Carl Backhouse, Paul F. Hoogendijk:
Final dialgebras: From categories to allegories. RAIRO Theor. Informatics Appl. 33(4/5): 401-426 (1999) - Beate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener:
On the complexity of the hidden weighted bit function for various BDD models. RAIRO Theor. Informatics Appl. 33(2): 103-116 (1999) - Bernd Borchert, Dietrich Kuske, Frank Stephan:
On existentially first-order definable languages and their relation to NP. RAIRO Theor. Informatics Appl. 33(3): 259-270 (1999) - Julian C. Bradfield:
Fixpoint alternation: Arithmetic, transition systems, and the binary tree. RAIRO Theor. Informatics Appl. 33(4/5): 341-356 (1999) - Rafael C. Carrasco, José Oncina:
Learning deterministic regular grammars from stochastic samples in polynomial time. RAIRO Theor. Informatics Appl. 33(1): 1-20 (1999) - Olivier Carton, Ramón Maceiras:
Computing the Rabin Index of a Parity Automaton. RAIRO Theor. Informatics Appl. 33(6): 495-506 (1999) - Andrea Corradini, Fabio Gadducci:
Rewriting on cyclic structures: Equivalence between the operational and the categorical description. RAIRO Theor. Informatics Appl. 33(4/5): 467-493 (1999) - Flavio Corradini, Rocco De Nicola, Anna Labella:
A finite axiomatization of nondeterministic regular expressions. RAIRO Theor. Informatics Appl. 33(4/5): 447-466 (1999) - Jennifer M. Davoren:
Topologies, continuity and bisimulations. RAIRO Theor. Informatics Appl. 33(4/5): 357-382 (1999) - Christiane Frougny:
On-line finite automata for addition in some numeration systems. RAIRO Theor. Informatics Appl. 33(1): 79-101 (1999) - Alfons Geser, Hans Zantema:
Non-looping string rewriting. RAIRO Theor. Informatics Appl. 33(3): 279-302 (1999) - Rudolf Grübel:
On the median-of-K version of Hoare's selection algorithm. RAIRO Theor. Informatics Appl. 33(2): 177-192 (1999) - Dilian Gurov, Bruce M. Kapron:
A note on negative tagging for least fixed-point formulae. RAIRO Theor. Informatics Appl. 33(4/5): 383-392 (1999) - Vesa Halava, Tero Harju:
Undecidability of the equivalence of finite substitutions on regular language. RAIRO Theor. Informatics Appl. 33(2): 117-124 (1999) - Juha Honkala:
On sequences defined by D0L power series. RAIRO Theor. Informatics Appl. 33(2): 125-132 (1999) - Juraj Hromkovic:
Communication complexity and lower bounds on multilective computations. RAIRO Theor. Informatics Appl. 33(2): 193-212 (1999) - Phan Trung Huy, Nguyen Huong Lam:
Unavoidable set: extension and reduction. RAIRO Theor. Informatics Appl. 33(3): 213-226 (1999) - Ralph Matthes:
Monotone (co)inductive types and positive fixed-point types. RAIRO Theor. Informatics Appl. 33(4/5): 309-328 (1999) - Christoph Meinel, Thorsten Theobald:
On the Influence of the State Encoding on OBDD-Representations of Finite State Machines. RAIRO Theor. Informatics Appl. 33(1): 21-32 (1999) - Kenichi Morita, Maurice Margenstern, Katsunobu Imai:
Universality of Reversible Hexagonal Cellular Automata. RAIRO Theor. Informatics Appl. 33(6): 535-550 (1999) - Luca Paolini, Simona Ronchi Della Rocca:
Call-by-value Solvability. RAIRO Theor. Informatics Appl. 33(6): 507-534 (1999) - Anne Preller, Patrice Duroux:
Normalisation of the Theory T of Cartesian Closed Categories and Conservativity of Extensions T[x] of T. RAIRO Theor. Informatics Appl. 33(3): 227-258 (1999) - Roman R. Redziejowski:
Construction of a deterministic -automaton using derivatives. RAIRO Theor. Informatics Appl. 33(2): 133-158 (1999) - Jörg Rothe:
Immunity and simplicity for exact counting and other counting classes. RAIRO Theor. Informatics Appl. 33(2): 159-176 (1999) - Jan J. M. M. Rutten:
A note on coinduction and weak bisimilarity for while programs. RAIRO Theor. Informatics Appl. 33(4/5): 393-400 (1999) - Helmut Seidl, Damian Niwinski:
On distributive fixed-point expressions. RAIRO Theor. Informatics Appl. 33(4/5): 427-446 (1999) - Carla Selmi:
Strongly locally testable semigroups with commuting idempotents and related languages. RAIRO Theor. Informatics Appl. 33(1): 47-58 (1999) - Maria J. Serna, Fatos Xhafa:
On the Average Case Complexity of Some P-complete Problems. RAIRO Theor. Informatics Appl. 33(1): 33-46 (1999)