Displaying 21 – 40 of 75

Showing per page

The range of non-linear natural polynomials cannot be context-free

Dömötör Pálvölgyi (2020)

Kybernetika

Suppose that some polynomial f with rational coefficients takes only natural values at natural numbers, i. e., L = { f ( n ) n } . We show that the base- q representation of L is a context-free language if and only if f is linear, answering a question of Shallit. The proof is based on a new criterion for context-freeness, which is a combination of the Interchange lemma and a generalization of the Pumping lemma.

The μ-calculus alternation-depth hierarchy is strict on binary trees

André Arnold (2010)

RAIRO - Theoretical Informatics and Applications

In this paper we give a simple proof that the alternation-depth hierarchy of the μ-calculus for binary trees is strict. The witnesses for this strictness are the automata that determine whether there is a winning strategy for the parity game played on a tree.

Théorie des magmoïdes

A. Arnold, M. Dauchet (1979)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Théorie des magmoïdes (I)

A. Arnold, M. Dauchet (1978)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Currently displaying 21 – 40 of 75