Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words Is Pspace-Complete

AuthID
 P-008-0CK
2
Author(s)
Document Type
Proceedings Paper
Year published
2011
Published
in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN: 0302-9743
Volume: 6735 LNCS, Pages: 230-238
Conference
7Th Conference on Computability in Europe, Cie 2011, Date: 27 June 2011 through 2 July 2011, Location: Sofia, Sponsors: National Science Foundation;Association for Symbolic Logic;European Mathematical Society;European Social Fund;Bulgarian National Science Fund
Indexing
Scopus®
Crossref®
Google Scholar®
Publication Identifiers
SCOPUS: 2-s2.0-80052973427
Source Identifiers
ISSN: 0302-9743
Export Publication Metadata
Marked List
 Add to Marked List
Info
At this moment we don't have any links to full text documens.

A place for researchers and their institutions

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service