Standard

Shortest Accepted Strings for Two-Way Finite Automata: Approaching the 2^n Lower Bound. / Мартынова, Ольга Максимовна; Охотин, Александр Сергеевич.

Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings. Vol. 13918 Lecture Notes in Computer Science. ed. Springer Nature, 2023. p. 134-145.

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

Harvard

Мартынова, ОМ & Охотин, АС 2023, Shortest Accepted Strings for Two-Way Finite Automata: Approaching the 2^n Lower Bound. in Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings. Lecture Notes in Computer Science edn, vol. 13918, Springer Nature, pp. 134-145, Descriptional Complexity of Formal Systems 2023, Потсдам, Brandenburg, Germany, 4/07/23. https://doi.org/10.1007/978-3-031-34326-1_10

APA

Мартынова, О. М., & Охотин, А. С. (2023). Shortest Accepted Strings for Two-Way Finite Automata: Approaching the 2^n Lower Bound. In Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings (Lecture Notes in Computer Science ed., Vol. 13918, pp. 134-145). Springer Nature. https://doi.org/10.1007/978-3-031-34326-1_10

Vancouver

Мартынова ОМ, Охотин АС. Shortest Accepted Strings for Two-Way Finite Automata: Approaching the 2^n Lower Bound. In Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings. Lecture Notes in Computer Science ed. Vol. 13918. Springer Nature. 2023. p. 134-145 https://doi.org/10.1007/978-3-031-34326-1_10

Author

Мартынова, Ольга Максимовна ; Охотин, Александр Сергеевич. / Shortest Accepted Strings for Two-Way Finite Automata: Approaching the 2^n Lower Bound. Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings. Vol. 13918 Lecture Notes in Computer Science. ed. Springer Nature, 2023. pp. 134-145

BibTeX

@inproceedings{a07bac67fce84b8d844257b5543ec8e8,
title = "Shortest Accepted Strings for Two-Way Finite Automata: Approaching the 2^n Lower Bound",
author = "Мартынова, {Ольга Максимовна} and Охотин, {Александр Сергеевич}",
year = "2023",
month = jul,
doi = "10.1007/978-3-031-34326-1_10",
language = "English",
isbn = "978-3-031-34325-4",
volume = "13918",
pages = "134--145",
booktitle = "Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings",
publisher = "Springer Nature",
address = "Germany",
edition = "Lecture Notes in Computer Science",
note = "null ; Conference date: 04-07-2023 Through 06-07-2023",

}

RIS

TY - GEN

T1 - Shortest Accepted Strings for Two-Way Finite Automata: Approaching the 2^n Lower Bound

AU - Мартынова, Ольга Максимовна

AU - Охотин, Александр Сергеевич

PY - 2023/7

Y1 - 2023/7

UR - https://www.mendeley.com/catalogue/003ce7e8-8fb7-3765-b0e3-2b3b3d5ee8f7/

U2 - 10.1007/978-3-031-34326-1_10

DO - 10.1007/978-3-031-34326-1_10

M3 - Conference contribution

SN - 978-3-031-34325-4

VL - 13918

SP - 134

EP - 145

BT - Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings

PB - Springer Nature

Y2 - 4 July 2023 through 6 July 2023

ER -

ID: 108695605