The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
Tight bounds on the complexity of cascaded decomposition of automata
The work
| Authors | Oded Maler; Amir Pnueli |
|---|---|
| Editors | |
| Type | misc |
| Year | 1990 |
| Also known as | maler2002tight |
| Citekey | maler1990tight |
Where it appeared
| Published in | Annual Symposium on Foundations of Computer Science |
|---|---|
| Publisher | Institute of Electrical and Electronics Engineers |
| Pages | 672--682 |
Identifiers
| DOI | 10.1109/fscs.1990.89589 |
|---|---|
| OpenAlex | W2187379055 |
Access
| Landing page | https://doi.org/10.1109/fscs.1990.89589 |
|---|
From OpenAlex, which stores abstracts as an index of words and their positions: what is shown is rebuilt from that, and reads fluently whether or not it is what the author wrote.
Abstract
Exponential upper and lower bounds on the size of the cascaded (Krohn-Rhodes) decomposition of automata are given. These results are used to obtain elementary algorithms for various translations between automata and temporal logic, where the previously known translations were nonelementary. The relevance of the result is discussed.>
How it got here
| How it got here | agent via openalex |
|---|---|
| Added | 2026-10-26 23:11 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@misc{maler1990tight,
title = {Tight bounds on the complexity of cascaded decomposition of automata},
author = {Oded Maler and Amir Pnueli},
year = {1990},
journal = {Annual Symposium on Foundations of Computer Science},
publisher = {Institute of Electrical and Electronics Engineers},
pages = {672--682},
doi = {10.1109/fscs.1990.89589},
}
This record lives at https://refs.drheap.org/maler1990tight/ and will keep
doing so. It used to be called maler2002tight, and those addresses still resolve to this one.