Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

ANT

Financiado

Automata in Number Theory

Finite automata are fundamental objects in Computer Science, of great importance on one hand for theoretical aspects (formal language theory, decidability, complexity) and on the other for practical applications (parsing). In num... ver más

31/03/2022

CNRS

1M€

Presupuesto del proyecto: 1M€

Líder del proyecto

CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Ver 2 Participantes

Financiación concedida El organismo H2020 notifico la concesión del proyecto el día 2022-03-31

ERC-CoG-2014: ERC Consolidator Grant

I+D

Cerrada hace 10 años

0% 100% 100%

2 Participantes

CNRS

1.44M€ | Lider

GP-PHARM

889.92K€ | Participante

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Proyectos interesantes

LASD Logic and Automata over Sequences with Data 2M€ Cerrado

PID2019-108991GB-I00 MATEMATICAS PARA EL DESARROLLO DE SISTEMAS INTELIGENTES 76K€ Cerrado

TIN2010-20967-C04-03 TEORIA, APLICACIONES Y SINERGIA EN SAT, CSP Y FDL 77K€ Cerrado

MTM2014-54151-P FORMALIZACION DE LAS MATEMATICAS: APLICACIONES EN CALCULO SI... 22K€ Cerrado

TIN2009-14562-C05-04 FEAST: FUNDAMENTOS Y EXTENSIONES DE LA TECNOLOGIA ANSWER SET... 141K€ Cerrado

NEAT Non-linear Existential Arithmetic Theories 181K€ Cerrado

Duración del proyecto: 78 meses Fecha Inicio: 2015-09-10
Fecha Fin: 2022-03-31

Líder del proyecto

CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 1M€

Descripción del proyecto Finite automata are fundamental objects in Computer Science, of great importance on one hand for theoretical aspects (formal language theory, decidability, complexity) and on the other for practical applications (parsing). In number theory, finite automata are mainly used as simple devices for generating sequences of symbols over a finite set (e.g., digital representations of real numbers), and for recognizing some sets of integers or more generally of finitely generated abelian groups or monoids. One of the main features of these automatic structures comes from the fact that they are highly ordered without necessarily being trivial (i.e., periodic). With their rich fractal nature, they lie somewhere between order and chaos, even if, in most respects, their rigidity prevails. Over the last few years, several ground-breaking results have lead to a great renewed interest in the study of automatic structures in arithmetics. A primary objective of the ANT project is to exploit this opportunity by developing new directions and interactions between automata and number theory. In this proposal, we outline three lines of research concerning fundamental number theoretical problems that have baffled mathematicians for decades. They include the study of integer base expansions of classical constants, of arithmetical linear differential equations and their link with enumerative combinatorics, and of arithmetics in positive characteristic. At first glance, these topics may seem unrelated, but, surprisingly enough, the theory of finite automata will serve as a natural guideline. We stress that this new point of view on classical questions is a key part of our methodology: we aim at creating a powerful synergy between the different approaches we propose to develop, placing automata theory and related methods at the heart of the subject. This project provides a unique opportunity to create the first international team focusing on these different problems as a whole.

Conecta tu I+D

Entra hoy

¿Olvide mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores