Skip to main content
Journal Article

Reduced power automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2608 194-202
DOI: 10.1007/3-540-44977-9_18
0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe a class of transitive semiautomata whose power automata are reduced: any two reachable sets of states have distinct behavior. These automata appear naturally in the study of one-dimensional cellular automata. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Sutner, K. (2003). Reduced power automata. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2608, 194–202. https://doi.org/10.1007/3-540-44977-9_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free