Standard
Boolean monadic recursive schemes as a logical characterization of the subsequential functions. / Bhaskar, Siddharth; Chandlee, Jane; Jardine, Adam; Oakden, Christopher.
Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Proceedings. ed. / Alberto Leporati; Carlos Martín-Vide; Dana Shapira; Claudio Zandron. Springer VS, 2020. p. 157-169 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12038 LNCS).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Bhaskar, S, Chandlee, J, Jardine, A & Oakden, C 2020,
Boolean monadic recursive schemes as a logical characterization of the subsequential functions. in A Leporati, C Martín-Vide, D Shapira & C Zandron (eds),
Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Proceedings. Springer VS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12038 LNCS, pp. 157-169, 14th International Conference on Language and Automata Theory and Applications, LATA 2020, Milan, Italy,
04/03/2020.
https://doi.org/10.1007/978-3-030-40608-0_10APA
Bhaskar, S., Chandlee, J., Jardine, A., & Oakden, C. (2020).
Boolean monadic recursive schemes as a logical characterization of the subsequential functions. In A. Leporati, C. Martín-Vide, D. Shapira, & C. Zandron (Eds.),
Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Proceedings (pp. 157-169). Springer VS. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 12038 LNCS
https://doi.org/10.1007/978-3-030-40608-0_10Vancouver
Bhaskar S, Chandlee J, Jardine A, Oakden C.
Boolean monadic recursive schemes as a logical characterization of the subsequential functions. In Leporati A, Martín-Vide C, Shapira D, Zandron C, editors, Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Proceedings. Springer VS. 2020. p. 157-169. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12038 LNCS).
https://doi.org/10.1007/978-3-030-40608-0_10Author
Bhaskar, Siddharth ; Chandlee, Jane ; Jardine, Adam ; Oakden, Christopher. / Boolean monadic recursive schemes as a logical characterization of the subsequential functions. Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Proceedings. editor / Alberto Leporati ; Carlos Martín-Vide ; Dana Shapira ; Claudio Zandron. Springer VS, 2020. pp. 157-169 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12038 LNCS).
Bibtex
@inproceedings{e783cc7f00044283bb3e493ffa46f415,
title = "Boolean monadic recursive schemes as a logical characterization of the subsequential functions",
abstract = "This paper defines boolean monadic recursive schemes (BMRSs), a restriction on recursive programs, and shows that when interpreted as transductions on strings they describe exactly the subsequential functions. We discuss how this new result furthers the study of the connections between logic, formal languages and functions, and automata.",
keywords = "Finite automata, Logic, Recursive program schemes, Subsequential functions",
author = "Siddharth Bhaskar and Jane Chandlee and Adam Jardine and Christopher Oakden",
year = "2020",
doi = "10.1007/978-3-030-40608-0_10",
language = "English",
isbn = "9783030406073",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer VS",
pages = "157--169",
editor = "Alberto Leporati and Carlos Mart{\'i}n-Vide and Dana Shapira and Claudio Zandron",
booktitle = "Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Proceedings",
note = "14th International Conference on Language and Automata Theory and Applications, LATA 2020 ; Conference date: 04-03-2020 Through 06-03-2020",
}
RIS
TY - GEN
T1 - Boolean monadic recursive schemes as a logical characterization of the subsequential functions
AU - Bhaskar, Siddharth
AU - Chandlee, Jane
AU - Jardine, Adam
AU - Oakden, Christopher
PY - 2020
Y1 - 2020
N2 - This paper defines boolean monadic recursive schemes (BMRSs), a restriction on recursive programs, and shows that when interpreted as transductions on strings they describe exactly the subsequential functions. We discuss how this new result furthers the study of the connections between logic, formal languages and functions, and automata.
AB - This paper defines boolean monadic recursive schemes (BMRSs), a restriction on recursive programs, and shows that when interpreted as transductions on strings they describe exactly the subsequential functions. We discuss how this new result furthers the study of the connections between logic, formal languages and functions, and automata.
KW - Finite automata
KW - Logic
KW - Recursive program schemes
KW - Subsequential functions
UR - http://www.scopus.com/inward/record.url?scp=85081553260&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-40608-0_10
DO - 10.1007/978-3-030-40608-0_10
M3 - Article in proceedings
AN - SCOPUS:85081553260
SN - 9783030406073
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 157
EP - 169
BT - Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Proceedings
A2 - Leporati, Alberto
A2 - Martín-Vide, Carlos
A2 - Shapira, Dana
A2 - Zandron, Claudio
PB - Springer VS
T2 - 14th International Conference on Language and Automata Theory and Applications, LATA 2020
Y2 - 4 March 2020 through 6 March 2020
ER -
