Automatic Kolmogorov complexity, normality, and finite state dimension revisited (extended version 6, 2020)

If W is a non-affine irreducible finitely generated Coxeter group, then W embeds as a discrete, C-Zariski dense subgroup of a complex simple Lie group with trivial centre, namely

We also show that (non-necessarily flat) morphisms f of affine Noetherian schemes which are coverings for the fpqc topology descend regularity, at least if f is finite, or in

Graph-based slicing that eliminates unnecessary tran- sitions and nodes produces an output that will not be a sub graph of the original. Although we term this amorphous slicing it

A regular binary tree T having s as generating sequene of leaves, is given in.

Considering the uniform distribution on sets of m non-empty words whose sum of lengths is n, we establish that the average state complexities of the rational operations

This paper shows three results of such a type that are stronger in some sense than other ones because (a) they deal with models of quantum finite automata with very little

Of course, it is easy to construct autonomous finite state machines with bijective next-state function together with an encoding which have exponential OBDD-size w.r.t.. the

Transcendence and linear independence over the field of algebraic numbers of abelian integrals of first, second and third kind.... Chudnovskij (1976) – Algebraic independence