Advanced Search
Home > Journals > Bull. Belg. Math. Soc. Simon Stevin > Volume 1 > Issue 2
Bulletin of the Belgian Mathematical Society - Simon Stevin
Journés montoises d'informatique théoretique
VOL. 1 · NO. 2 | 1994
 
VIEW ALL ABSTRACTS +
Front Matter
Table of Contents, Bull. Belg. Math. Soc. Simon Stevin, vol. 1, no. 2 (1994)
Bull. Belg. Math. Soc. Simon Stevin 1 (2), (1994) Open Access
No abstract available
DOWNLOAD PAPER
Articles
Sur la complexité des suites infinies
Jean-Paul Allouche
Bull. Belg. Math. Soc. Simon Stevin 1 (2), 133-143, (1994) DOI: 10.36045/bbms/1103408543 Open Access
KEYWORDS: Complexity, factors (subwords) of infinite words, substitutive sequences, automatic sequences, CD0L sequences, 68R15, 11B85
No abstract available
DOWNLOAD PAPER
Facteurs des suites de Rudin-Shapiro généralisées
Jean-Paul Allouche, Mireille Bousquet-Mélou
Bull. Belg. Math. Soc. Simon Stevin 1 (2), 145-164, (1994) DOI: 10.36045/bbms/1103408544 Open Access
KEYWORDS: Rudin-Shapiro sequences, Complexity, recurrence function, algebraic languages, {$k$}-powerfree words, paperfolding sequences, 68R15, 11B85, 68Q45
No abstract available
DOWNLOAD PAPER
On 2{PFA}s and the Hadamard quotient of formal power series
Marcella Anselmo, Alberto Bertoni
Bull. Belg. Math. Soc. Simon Stevin 1 (2), 165-173, (1994) DOI: 10.36045/bbms/1103408545 Open Access
KEYWORDS: Two-way probabilistic automata, events, formal power series, Hadamard quotient, 68Q70, 68Q45, 68Q68
No abstract available
DOWNLOAD PAPER
Morphismes de Sturm
Jean Berstel, Patrice Séébold
Bull. Belg. Math. Soc. Simon Stevin 1 (2), 175-189, (1994) DOI: 10.36045/bbms/1103408546 Open Access
KEYWORDS: infinite words, iterated morphisms, Sturmian words, dynamical systems, continued fractions, 68R15, 20M05, 20M35
No abstract available
DOWNLOAD PAPER
Logic and {$p$}-recognizable sets of integers
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 Open Access
KEYWORDS: infinite words, {$p$}-recognizable sequences, finite automata, first-order definability, formal power series, 11B85, 03D05, 68Q45, 68R15
No abstract available
DOWNLOAD PAPER
Des bornes exactes de la complexité des algorithmes séquentiels de recherche d'un motif
Christophe Hancart
Bull. Belg. Math. Soc. Simon Stevin 1 (2), 239-252, (1994) DOI: 10.36045/bbms/1103408548 Open Access
KEYWORDS: string matching, string searching, text editing, computational complexity, worst case behavior, finite automata, 68Q25, 68Q20, 68R15, 68U15
No abstract available
DOWNLOAD PAPER
Equations in words: an algorithmic contribution
Jean Néraud
Bull. Belg. Math. Soc. Simon Stevin 1 (2), 253-283, (1994) DOI: 10.36045/bbms/1103408549 Open Access
KEYWORDS: Free monoid, word, factor, period, morphism, equation, solution, Pattern, algorithm, Complexity, 68R15
No abstract available
DOWNLOAD PAPER
Nondeterminism versus determinism of finite automata over directed acyclic graphs
Andreas Potthoff, Sebastian Seibert, Wolfgang Thomas
Bull. Belg. Math. Soc. Simon Stevin 1 (2), 285-298, (1994) DOI: 10.36045/bbms/1103408550 Open Access
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
DOWNLOAD PAPER
Back to Top