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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Citations (Scopus)
Original languageEnglish
Title of host publicationDESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014
EditorsH Jurgensen, J Karhumaki, A Okhotin
PublisherSpringer Verlag
Pages306-317
Number of pages12
Volume8614 LNCS
ISBN (Print)978-3-319-09703-9
DOIs
Publication statusPublished - 2014
Event16th International Workshop Descriptional Complexity of Formal Systems (DCFS) - Turku, Finland
Duration: 5 Aug 20148 Aug 2014

Publication series

NameLecture Notes in Computer Science
PublisherSPRINGER-VERLAG BERLIN
Volume8614
ISSN (Print)0302-9743

Conference

Conference16th International Workshop Descriptional Complexity of Formal Systems (DCFS)
CountryFinland
Period05/08/201408/08/2014

Keywords

  • ideal language
  • PSPACE-completeness
  • reset complexity
  • reset word
  • synchronizing automaton

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

WoS ResearchAreas Categories

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

Fingerprint

Dive into the research topics of 'Complexity of Checking Whether Two Automata Are Synchronized by the Same Language'. Together they form a unique fingerprint.

Cite this