1980•Journal of Computer and System SciencesOpen access

Lower bounds on the size of sweeping automata

Michael Sipser

Open full text 104 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 104 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Deterministic automaton, Two-way deterministic finite automaton, Nondeterministic finite automaton, Büchi automaton, Deterministic finite automaton, Automaton, Timed automaton, Nondeterministic algorithm

Back to paper search Browse research topics Original source

Lower bounds on the size of sweeping automata — Research Paper | ScholarLens