I'm a doctor in computer science and PostDoc in the Computer Science lab Université_libre_de_Bruxelles. Before that I was a phd student at IRIF in Paris VII and a grade student of École Normale Supérieure of Paris.
I'm trying to take time to write down into wikipedia the missing information of my field, when I learn them and see they are not currently in wikipedia.
- Random-access Turing machine
- Configuration graph
- Logarithmic time hierarchy
- Circuit (computer theory) because before me wikipedia knew only the boolean circuits
- Integer circuit
- Circuits over sets of natural numbers
- Second order in descriptive complexity/finite model theory.
- High order in descriptive complexity/finite model theory. There are results I know but that I can not write in this article, because they only are in an article I wrote and not yet submitted to a journal.
- First order in descriptive complexity/finite model theory. The article existed before me but was only a stub.
- Padding argument, it was a red link on the Immerman–Szelepcsényi theorem page.
- Büchi arithmetic
- Skolem arithmetic and its disambiguation page
- recognizable set
- rational set
- Weak Büchi automaton
- Unambiguous finite automaton
- Unambiguous Turing machine
- Multiplicative independence
- Real-time queue and amortized queue
- Real-time deque
- Sparse representations of numbers
- Purely functional datastructure
- Purely functional programming
- Autocorrelation (words)
- Profinite words
- Variety of finite semigroups
- Persistent array
Non trivial changes
- ELEMENTARY I gave the descriptive complexity caracterisation of this complexity class.
- Linear logic
- L (complexity)
- bounded alternating Turing machine
- Nested word
- Thompson's construction algorithm
- Presburger_arithmetic#Presburger-definable_integer_relation Characterization of the Presburger-definable sets.
- Skew binary number system
- Lexicographic breadth-first search Explaining the word Lexicographic, characterizing the LexBFS orders.
- Quotients and divisions of semigroups
- Generating set of a semigroup/monoid
- Graded monoid
- Special classes of semigroups (Adding the variety column, and some examples from Pin's textbook)
- Specification and specifiable classes in analytic combinatorics
A few modification
- Finite model property
- Recursively enumerable language
- Mealy machine (which surprises me because even if the history page assert that I wrote a paragraph, I don't remember doing it, nor do I remember that I ever worked one day with those machines, and I don't know anymore anything of what I added)
- Reflected polynomial (Mostly stating that some author use this name instead of the more standard one.)