Journés montoises d'informatique théoretique
VOL. 1 · NO. 2 | 1994
 
VIEW ALL ABSTRACTS +
Front Matter
Bull. Belg. Math. Soc. Simon Stevin 1 (2), (1994)
No abstract available
Articles
Jean-Paul Allouche
Bull. Belg. Math. Soc. Simon Stevin 1 (2), 133-143, (1994) DOI: 10.36045/bbms/1103408543
KEYWORDS: Complexity, factors (subwords) of infinite words, substitutive sequences, automatic sequences, CD0L sequences, 68R15, 11B85
No abstract available
Jean-Paul Allouche, Mireille Bousquet-Mélou
Bull. Belg. Math. Soc. Simon Stevin 1 (2), 145-164, (1994) DOI: 10.36045/bbms/1103408544
KEYWORDS: Rudin-Shapiro sequences, Complexity, recurrence function, algebraic languages, {$k$}-powerfree words, paperfolding sequences, 68R15, 11B85, 68Q45
No abstract available
Marcella Anselmo, Alberto Bertoni
Bull. Belg. Math. Soc. Simon Stevin 1 (2), 165-173, (1994) DOI: 10.36045/bbms/1103408545
KEYWORDS: Two-way probabilistic automata, events, formal power series, Hadamard quotient, 68Q70, 68Q45, 68Q68
No abstract available
Jean Berstel, Patrice Séébold
Bull. Belg. Math. Soc. Simon Stevin 1 (2), 175-189, (1994) DOI: 10.36045/bbms/1103408546
KEYWORDS: infinite words, iterated morphisms, Sturmian words, dynamical systems, continued fractions, 68R15, 20M05, 20M35
No abstract available
Véronique Bruyàre, Georges Hansel, Christian Michaux, Roger Villemaire
Bull. Belg. Math. Soc. Simon Stevin 1 (2), 191-238, (1994) DOI: 10.36045/bbms/1103408547
KEYWORDS: infinite words, {$p$}-recognizable sequences, finite automata, first-order definability, formal power series, 11B85, 03D05, 68Q45, 68R15
No abstract available
Christophe Hancart
Bull. Belg. Math. Soc. Simon Stevin 1 (2), 239-252, (1994) DOI: 10.36045/bbms/1103408548
KEYWORDS: string matching, string searching, text editing, computational complexity, worst case behavior, finite automata, 68Q25, 68Q20, 68R15, 68U15
No abstract available
Jean Néraud
Bull. Belg. Math. Soc. Simon Stevin 1 (2), 253-283, (1994) DOI: 10.36045/bbms/1103408549
KEYWORDS: Free monoid, word, factor, period, morphism, equation, solution, Pattern, algorithm, Complexity, 68R15
No abstract available
Andreas Potthoff, Sebastian Seibert, Wolfgang Thomas
Bull. Belg. Math. Soc. Simon Stevin 1 (2), 285-298, (1994) DOI: 10.36045/bbms/1103408550
KEYWORDS: Labelled finite graphs, recognizability of graph languages, automata on acyclic graphs, non deterministic graph automata, deterministic graph automata, 68Q68, 03D05, 68Q10, 68R10
No abstract available
Back to Top