There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 22

Record: found
Abstract: not found
Article: not found

Testing and generating infinite sequences by a finite automaton

Robert McNaughton (1966)

0 comments Cited 19 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Classifying regular events in symbolic logic

Wolfgang Thomas (1982)

0 comments Cited 9 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Algebraic decision procedures for local testability

Robert McNaughton (1974)

0 comments Cited 6 times – based on 0 reviews      Review now

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 1989

Publication date (Online): November 29 2005

Pages: 63-79

DOI: 10.1007/BFb0035752

SO-VID: f48491bd-14d8-4768-8bee-0503b8dfcece

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 7

An EILENBERG theorem for ∞-languages
Authors: Thomas Wilke
Piecewise and Local Threshold Testability of DFA
Authors: A. Trahtman
Regular Tree Languages Definable in FO
Authors: Michael Benedikt, Luc Segoufin

See all cited by

Factors of words

Read this book at

Related collections

ScienceOpen Research

Most cited references 22

Testing and generating infinite sequences by a finite automaton

Classifying regular events in symbolic logic

Algebraic decision procedures for local testability

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 2,137

Cited by 7