Complexity of Checking Whether Two Automata Are Synchronized by the Same Language

科研成果: Conference contribution同行评审

5 引用 (Scopus)
源语言English
主期刊名DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014
编辑H Jurgensen, J Karhumaki, A Okhotin
出版商Springer Verlag
306-317
页数12
8614 LNCS
ISBN(印刷版)978-3-319-09703-9
DOI
Published - 2014
活动16th International Workshop Descriptional Complexity of Formal Systems (DCFS) - Turku, Finland
期限: 5 八月 20148 八月 2014

出版系列

姓名Lecture Notes in Computer Science
出版商SPRINGER-VERLAG BERLIN
8614
ISSN(印刷版)0302-9743

Conference

Conference16th International Workshop Descriptional Complexity of Formal Systems (DCFS)
国家Finland
时期05/08/201408/08/2014

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

WoS ResearchAreas Categories

  • Computer Science, Theory & Methods
  • Engineering, Electrical & Electronic

指纹

探究 'Complexity of Checking Whether Two Automata Are Synchronized by the Same Language' 的科研主题。它们共同构成独一无二的指纹。

引用此