Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Queen's University

$48,000.00

Finite-state machines and their extensions: Foundational questions and applications

EF 2021-22

Résumé
Cellular automata algorithms; Decidability and undecidability; Finite-state machines; Formal languages; Limited nondeterminism; State and transition complexity; Visibly pushdown automata
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
RGPIN-2018-04110
Name nom
Salomaa, Kai
Department département
School of Computing
Organization id
29
Institution établissement
Queen's University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2021
Competition year année de concours
2018
Award amount
48000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2712
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Theory of computation
Research subject fr
Théorie de calcul
Installment
inst:4
Partie
1
Nb partie
5
Application title
Finite-state machines and their extensions: Foundational questions and applications
Keyword
NSERC
Application summary
Cellular automata algorithms; Decidability and undecidability; Finite-state machines; Formal languages; Limited nondeterminism; State and transition complexity; Visibly pushdown automata