Concepedia

Myhill-nerode Theorem

The Myhill-Nerode Theorem is a formal theorem in automata theory that establishes a necessary and sufficient condition for a language to be regular by characterizing it in terms of the number of distinguishable states under a right-invariant equivalence relation induced by the language.

16

Publications

532

Citations

31

Authors

27

Institutions

Publications per year

2017–2026

2

Parents

Publications

16

Myhill–Nerode type theory for fuzzy languages and automata

Jelena Ignjatović, Miroslav Ćirić, Stojan Bogdanović et al. · Fuzzy Sets and Systems · 2009 · 100 citations

, , +13

An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations

Michael R. Fellows, Michael A. Langston · 1989 · 91 citations

, , +12

Automata with Group Actions

Mikołaj Bojańczyk, Bartek Klin, Sławomir Lasota · 2011 · 85 citations

, , +14

Automata on guarded strings and applications

Dexter Kozen · Matemática Contemporânea · 2003 · 61 citations · Full text

, , +17

A learning algorithm for top-down XML transformations

Aurélien Lemay, Sebastian Maneth, Joachim Niehren · 2010 · 43 citations · Full text

, , +10

1–5 of 16

Authors

31

  1. MA
    Michael A. Langston

    University of Tennessee at Knoxville, United States

    2 publications · 109 citations

    2

    h-index

  2. MR
    Michael R. Fellows

    University of Victoria, Canada

    2 publications · 109 citations

    2

    h-index

  3. DK
    Dexter Kozen

    Cornell University, United States

    2 publications · 72 citations

    2

    h-index

  4. MB
    Mikołaj Bojańczyk

    University of Warsaw, Poland

    1 publications · 85 citations

    1

    h-index

  5. MK
    M. K. Dubey

    Indian Institute of Technology Dhanbad, India

    1 publications · 13 citations

    1

    h-index

1–5 of 31

Institutions

27

  1. UNSW Sydney

    Sydney, Australia

    2 h-index

    2 publications

    53 citations

  2. Data61

    Sydney, Australia

    2 h-index

    2 publications

    53 citations

  3. University of Oxford

    Oxford, United Kingdom

    1 h-index

    2 publications

    40 citations

  4. University of Warsaw

    Warsaw, Poland

    1 h-index

    3 publications

    255 citations

  5. Hebrew University of Jerusalem

    Jerusalem, Israel

    1 h-index

    2 publications

    26 citations

  6. Victoria University of Wellington

    Wellington, New Zealand

    1 h-index

    1 publications

    10 citations

  7. Yale University

    New Haven, United States

    1 h-index

    3 publications

    39 citations

  8. Université de Lille

    Lille, France

    1 h-index

    2 publications

    86 citations

1–8 of 27

Venues

  1. Fuzzy Sets and Systems

    2 publications · 114 citations

    2

    h-index

  2. ACM Transactions on Computational Logic

    TOCL · 1 publications · 13 citations

    1

    h-index

  3. Algorithmica

    1 publications · 10 citations

    1

    h-index

  4. DOAJ (DOAJ: Directory of Open Access Journals)

    Repository · 1 publications · 13 citations

    1

    h-index

  5. Journal of Intelligent & Fuzzy Systems

    1 publications · 13 citations

    1

    h-index

1–5