Completely reachable automata › Research Explorer

DOI

https://doi.org/10.1007/978-3-319-41114-9_1
Final published version

Original language	English
Title of host publication	Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Proceedings
Publisher	Springer Verlag
Pages	1-17
Number of pages	17
Volume	9777
ISBN (Print)	9783319411132
DOIs	https://doi.org/10.1007/978-3-319-41114-9_1
Publication status	Published - 2016
Event	18th IFIP WG 1.2 International Conference on Descriptional Complexity of Formal Systems, DCFS 2016 - Bucharest Duration: 5 Jul 2016 → 8 Jul 2016

Publication series

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

Conference

Conference	18th IFIP WG 1.2 International Conference on Descriptional Complexity of Formal Systems, DCFS 2016
City	Bucharest
Period	05/07/2016 → 08/07/2016

ASJC Scopus subject areas

Computer Science(all)
Theoretical Computer Science

Research areas

Complete reachability, Deterministic finite automaton, PSPACE-completeness, Syntactic complexity, Transition monoid

ID: 1059659