Reset complexity of ideal languages over a binary alphabet

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)
Original languageEnglish
Title of host publicationDescriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings
PublisherSpringer Verlag
Pages262-273
Number of pages12
Volume10316 LNCS
ISBN (Print)9783319602516
DOIs
Publication statusPublished - 2017
Event19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017 - Milano, Italy
Duration: 3 Jul 20175 Jul 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10316 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Conference

Conference19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017
CountryItaly
CityMilano
Period03/07/201705/07/2017

Keywords

  • Ideal language
  • PSPACE-completeness
  • Reset complexity
  • Reset word
  • Synchronizing automaton

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

WoS ResearchAreas Categories

  • Computer Science, Software Engineering
  • Computer Science, Theory & Methods
  • Logic

Fingerprint Dive into the research topics of 'Reset complexity of ideal languages over a binary alphabet'. Together they form a unique fingerprint.

Cite this