Standard
Completely reachable automata. /
Bondar, Eugenija A.; Volkov, Mikhail V. Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Proceedings. Vol. 9777 Springer Verlag, 2016. p. 1-17 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9777).
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Harvard
Bondar, EA & Volkov, MV 2016,
Completely reachable automata. in
Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Proceedings. vol. 9777, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9777, Springer Verlag, pp. 1-17, 18th IFIP WG 1.2 International Conference on Descriptional Complexity of Formal Systems, DCFS 2016, Bucharest,
05/07/2016.
https://doi.org/10.1007/978-3-319-41114-9_1
APA
Vancouver
Bondar EA, Volkov MV.
Completely reachable automata. In Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Proceedings. Vol. 9777. Springer Verlag. 2016. p. 1-17. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-41114-9_1
Author
Bondar, Eugenija A. ; Volkov, Mikhail V. /
Completely reachable automata. Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Proceedings. Vol. 9777 Springer Verlag, 2016. pp. 1-17 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
BibTeX
@inproceedings{a4d8df1ab54c43e28ebbae9e085c209d,
title = "Completely reachable automata",
keywords = "Complete reachability, Deterministic finite automaton, PSPACE-completeness, Syntactic complexity, Transition monoid",
author = "Bondar, {Eugenija A.} and Volkov, {Mikhail V.}",
year = "2016",
doi = "10.1007/978-3-319-41114-9_1",
language = "English",
isbn = "9783319411132",
volume = "9777",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "1--17",
booktitle = "Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Proceedings",
address = "Germany",
note = "18th IFIP WG 1.2 International Conference on Descriptional Complexity of Formal Systems, DCFS 2016 ; Conference date: 05-07-2016 Through 08-07-2016",
}
RIS
TY - GEN
T1 - Completely reachable automata
AU - Bondar, Eugenija A.
AU - Volkov, Mikhail V.
PY - 2016
Y1 - 2016
KW - Complete reachability
KW - Deterministic finite automaton
KW - PSPACE-completeness
KW - Syntactic complexity
KW - Transition monoid
UR - http://www.scopus.com/inward/record.url?scp=84978924306&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-41114-9_1
DO - 10.1007/978-3-319-41114-9_1
M3 - Conference contribution
AN - SCOPUS:84978924306
SN - 9783319411132
VL - 9777
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 17
BT - Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Proceedings
PB - Springer Verlag
T2 - 18th IFIP WG 1.2 International Conference on Descriptional Complexity of Formal Systems, DCFS 2016
Y2 - 5 July 2016 through 8 July 2016
ER -
