Boolean monadic recursive schemes as a logical characterization of the subsequential functions

DOI10.1007/978-3-030-40608-0_10zbMath1437.68042OpenAlexW3008224529MaRDI QIDQ782569

Christopher Oakden, Jane Chandlee, Adam Jardine, Siddharth Bhaskar

Publication date: 27 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-40608-0_10

zbMATH Keywords

finite automatarecursive program schemeslogicsubsequential functions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

This page was built for publication: Boolean monadic recursive schemes as a logical characterization of the subsequential functions