Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 519

The DOI matches its Crossref record.

Regular Expressions and State Graphs for Automata

McNaughton, R., Yamada, H.·1960·IEEE Transactions on Electronic Computers

Abstract

Algorithms are presented for 1) converting a state graph describing the behavior of an automaton to a regular expression describing the behavior of the same automaton (section 2), and 2) for converting a regular expression into a state graph (sections 3 and 4). These algorithms are justified by theorems, and examples are given. The first section contains a brief introduction to state graphs and the regular-expression language.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tec.1960.5221603

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 519

Metadata

Authors
McNaughton, R., & Yamada, H.
Venue
IEEE Transactions on Electronic Computers
Published
1960-03
Volume
EC-9
Issue
1
Pages
39-47
ISSN
0367-7508 (ISSN-L)
OpenAlex
W2129414328
Cited by
519
References
0
FWCI
13.65
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Regular Expressions and State Graphs for Automata. https://app.cochat.ai/papers/10.1109/tec.1960.5221603
The paper
McNaughton, R., & Yamada, H. (1960). Regular Expressions and State Graphs for Automata. IEEE Transactions on Electronic Computers. https://doi.org/10.1109/tec.1960.5221603

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.