On the computational complexity of problems related to distinguishability sets

Published 2018 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
On the computational complexity of problems related to distinguishability sets
Authors
Keywords
Distinguishability sets, Synchronization, Computational complexity, State complexity, Deterministic finite automata
Journal
INFORMATION AND COMPUTATION
Volume 259, Issue -, Pages 225-236
Publisher
Elsevier BV
Online
2017-09-06
DOI
10.1016/j.ic.2017.09.003

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.