Rational Languages

Rational Languages is a formal language class in theoretical computer science and analytic combinatorics, defined as the family of languages that can be described by regular expressions and recognized by finite automata, thereby forming the subclass of languages generated by rational operations of union, concatenation, and Kleene star over a finite alphabet.

29

Publications

1.1K

Citations

45

Authors

31

Institutions

Publications per year

2017–2026

1

Authors

45

  1. CR
    Christophe Reutenauer

    Université du Québec à Montréal, Canada

    2 publications · 75 citations

    2

    h-index

  2. CR
    Chloé Rispal

    Laboratoire d'Informatique Algorithmique: Fondements et Applications, France

    2 publications · 44 citations

    2

    h-index

  3. PV
    Pedro V. Silva

    Universidade do Porto, Portugal

    2 publications · 26 citations

    2

    h-index

  4. AA
    André Arnold

    Université de Bordeaux, France

    2 publications · 106 citations

    2

    h-index

  5. FD
    François Denis

    Université de Limoges, France

    2 publications · 94 citations

    2

    h-index

1–5 of 45

Venues

  1. Theoretical Computer Science

    8 publications · 332 citations

    8

    h-index

  2. SIAM Journal on Computing

    2 publications · 70 citations

    2

    h-index

  3. Electronic Notes in Theoretical Computer Science

    ENTCS · 2 publications · 33 citations

    2

    h-index

  4. Transactions of the American Mathematical Society

    TRAN · 2 publications · 109 citations

    2

    h-index

  5. Mathematical Structures in Computer Science

    MSCS · 1 publications · 15 citations

    1

    h-index

1–5