Synchronization problems in automata without non-trivial cycles

标题

作者

关键词

Synchronizing automaton, Computational complexity, Inapproximability, Weakly acyclic automaton, Subset rank, Synchronizable set

出版物

THEORETICAL COMPUTER SCIENCE

Volume -, Issue -, Pages -

出版商

Elsevier BV

发表日期

2019-01-04

DOI

10.1016/j.tcs.2018.12.026

向作者/读者发起求助以获取更多资源

Protocol

在线求助

Reagent

在线求助

Reprint

联系作者

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

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