Concepedia

Linear Bounded Automata

Linear Bounded Automata is a deterministic or nondeterministic Turing machine that operates within a tape space bounded by the length of the input string, distinguishing it from other Turing machines by restricting tape usage to a linear function of the input size.

4

Publications

396

Citations

4

Authors

3

Institutions

Publications per year

2017–2026

0

Variants

LbaLinear Bounded Automaton

Parents

Publications

4

1–5 of 4

Authors

4

  1. AR
    Alvy Ray Smith

    New York University, United States

    1 publications · 60 citations

    1

    h-index

  2. FO
    Fumiya Okubo

    Kyushu University, Japan

    1 publications · 10 citations

    1

    h-index

  3. RV
    Ronald V. Book

    University of California, Santa Barbara, United States

    1 publications · 55 citations

    1

    h-index

  4. SK
    S.-Y. Kuroda

    University of California San Diego, United States

    1 publications · 271 citations

    1

    h-index

  5. JN
    John N. Shutt

    Worcester Polytechnic Institute, United States

    1 publications · 17 citations

    0

    h-index

1–5 of 4

Institutions

3

  1. New York University

    New York, United States

    1 h-index

    1 publications

    60 citations

  2. Massachusetts Institute of Technology

    Cambridge, United States

    1 h-index

    1 publications

    271 citations

  3. Waseda University

    Tokyo, Japan

    1 h-index

    1 publications

    10 citations

1–3 of 3

Venues

  1. SIAM Journal on Computing

    1 publications · 55 citations

    1

    h-index

  2. RAIRO - Theoretical Informatics and Applications

    ITA · 1 publications · 10 citations

    1

    h-index

  3. Information and Control

    1 publications · 271 citations

    1

    h-index

  4. Digital WPI

    Repository · 1 publications · 17 citations

1–4