Tight bounds on the complexity of cascaded decomposition of automata

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 rele...

Full description

Saved in:
Bibliographic Details
Published inFoundations of Computer Science, 31st Symposium pp. 672 - 682 vol.2
Main Authors Maler, O., Pnueli, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1990
Subjects
Automata
Counting circuits
Logic
Mathematics
Upper bound
Online AccessGet full text
ISBN081862082X
9780818620829
DOI10.1109/FSCS.1990.89589

Cover

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.< >
AbstractList 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.< >
Author Maler, O.
Pnueli, A.
Author_xml – sequence: 1
  givenname: O.
  surname: Maler
  fullname: Maler, O.
  organization: INRIA-IRISA, Rennes, France
– sequence: 2
  givenname: A.
  surname: Pnueli
  fullname: Pnueli, A.
BookMark eNotj81KAzEYRQMqaGvX4i4vMGN-p8lSRqtCwUUruCtfkm9spDMpTQr27R1_7uYuzuHCnZDzIQ1IyA1nNefM3i1W7arm1rLaWG3sGZkww00jmBHvl2SW8ycbo7WRQl6Rh3X82Bbq0nEImaaBli1Sn_r9Dr9iOdHUUQ_ZQ8BAA_6AlGOJozgSOJbUQ4FrctHBLuPsv6fkbfG4bp-r5evTS3u_rCJnslS-USoEdAAardFSgBWh0QqQKa04t9rNAxg598aB4kE6FlxwTjlvus4KOSW3f7sRETf7Q-zhcNr83pTfho5LbQ
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/FSCS.1990.89589
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EndPage 682 vol.2
ExternalDocumentID 89589
GroupedDBID 6IE
6IK
6IL
AAJGR
AAWTH
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IERZE
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i103t-c644ddebaa5e98532a92d654ae04541195b7da837c8ba41d3b0dbdbb4bc8ff923
IEDL.DBID RIE
ISBN 081862082X
9780818620829
IngestDate Tue Aug 26 17:02:29 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i103t-c644ddebaa5e98532a92d654ae04541195b7da837c8ba41d3b0dbdbb4bc8ff923
ParticipantIDs ieee_primary_89589
PublicationCentury 1900
PublicationDate 19900000
PublicationDateYYYYMMDD 1990-01-01
PublicationDate_xml – year: 1990
  text: 19900000
PublicationDecade 1990
PublicationTitle Foundations of Computer Science, 31st Symposium
PublicationTitleAbbrev SFCS
PublicationYear 1990
Publisher IEEE Comput. Soc. Press
Publisher_xml – name: IEEE Comput. Soc. Press
SSID ssj0000558323
Score 1.2155544
Snippet 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...
SourceID ieee
SourceType Publisher
StartPage 672
SubjectTerms Automata
Counting circuits
Logic
Mathematics
Upper bound
Title Tight bounds on the complexity of cascaded decomposition of automata
URI https://ieeexplore.ieee.org/document/89589
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LS8NAEF60J71oteKbPXhNuslumuy5WopQEdpCb2UfsyBCIjYB8dc7u0krigdvSQaWsK_5dvabbwi5QwTOTCIgSnE5REIZGUlwIhImBaWAGxOuC2ZPo-lSPK6yVSeTE3JhACCQzyD2j-Eu31am8aGyYSGzQu6TfZxkbabWLprCsgynJg8CjwmCdHRsW3md7bvshH0SJoeT-Xju8_RYHJr8UVklOJbJUVuhaBP0CD2f5DVuah2bz19qjf_752My-E7go88719Qne1CekMPZTqJ1c0ruF_5YTrUvq7ShVUnRRgPBHD4QmdPKUaM2nj1vqQVv6Ohd3qKausKG1IAsJw-L8TTqSipELwnjdWQQ_uCGppXKQKKnTpVM7SgTCrwUn5d_07lVeGg1hVYisVwzq63WQpvCOQSDZ6RXViWcEwq4dJ3TVhSMC5fniudKaM4Q0HDHnLwgfd8b67dWNWMdOuLyr49X5MCPRRvYuCa9-r2BG3T1tb4No_wFrV6neA
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3PS8MwFA46D-pFpxN_m4PXdumSrs15OqZuQ9gGu438BBFasS2If70vaTdRPHhr-iCEpOn35eW97yF0CwycqIiZoAfbIWBC8YAbywKmekYIQ5Xy1wWTaX-0YI_LeNnI5PhcGGOMDz4zoXv0d_k6V5VzlXVTHqd8G-0A6rO4ztXa-FNIHMPHSb3EYwQ0HaBtLbCzbvNG2icivDucDWYuU4-EvtMftVU8tAwP6hpFhVckdBElr2FVylB9_tJr_N-oD1HnO4UPP2_AqY22THaE9icbkdbiGN3N3cEcS1dYqcB5hsGGfYi5-QBujnOLlShc_LzG2jhDE-DlLKIqc-hIdNBieD8fjIKmqELwEhFaBgoIEPzSpBCx4YDVPcF7uh8zYZwYnxOAk4kWcGxVqRQs0lQSLbWUTKrUWqCDJ6iV5Zk5RdjA5rVWapYSymySCJoIJikBSkMtsfwMtd1srN5q3YyVn4jzv17eoN3RfDJejR-mTxdoz61L7ea4RK3yvTJXAPylvPYr_gWkZqrF
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Foundations+of+Computer+Science%2C+31st+Symposium&rft.atitle=Tight+bounds+on+the+complexity+of+cascaded+decomposition+of+automata&rft.au=Maler%2C+O.&rft.au=Pnueli%2C+A.&rft.date=1990-01-01&rft.pub=IEEE+Comput.+Soc.+Press&rft.isbn=9780818620829&rft.spage=672&rft.epage=682+vol.2&rft_id=info:doi/10.1109%2FFSCS.1990.89589&rft.externalDocID=89589
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620829/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620829/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620829/sc.gif&client=summon&freeimage=true