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

DOI10.1007/978-3-030-40608-0_10MaRDI QIDQ782569zbMATH OpenOpenAlexFDO

Authors Siddharth Bhaskar, Jane Chandlee, Adam Jardine, Christopher Oakden

Publication date 27 July 2020

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

zbMATH Keywords

finite automatalogicrecursive program schemessubsequential functions

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4024754
• scientific article; zbMATH DE number 19761
• Parallel functions in recursive program schemes
• Programmschemata mit Booleschen Unterprogrammen
• Bounded monotone recursion and multihead automata

Cited in

(1)

• Programmschemata mit Booleschen Unterprogrammen

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782569)