Reset complexity of ideal languages over a binary alphabet › Research Explorer

Reset complexity of ideal languages over a binary alphabet

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

DOI

https://doi.org/10.1007/978-3-319-60252-3_21
Final published version

Marina Maslennikova

Original language	English
Title of host publication	Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings
Publisher	Springer Verlag
Pages	262-273
Number of pages	12
Volume	10316 LNCS
ISBN (Print)	9783319602516
DOIs	https://doi.org/10.1007/978-3-319-60252-3_21
Publication status	Published - 2017
Event	19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017 - Milano, Italy Duration: 3 Jul 2017 → 5 Jul 2017

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10316 LNCS
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Conference

Conference	19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017
Country/Territory	Italy
City	Milano
Period	03/07/2017 → 05/07/2017

WoS ResearchAreas Categories

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

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Research areas

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

ID: 1977936