A Kleene characterization of computability

DOI10.1016/J.IPL.2006.09.003MaRDI QIDQ845916zbMATH OpenOpenAlexFDO

Authors Joost Engelfriet

Publication date 29 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2006.09.003

zbMATH Keywords

binary relationformal languagesKleenerecursive enumerable

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A note on morphic characterization of languages
• Abstract grammars based on transductions
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• Iterated a-NGSM maps and Γ systems
• Iteration of rational transductions
• On characterizations of recursively enumerable languages

Cited in

(3)

• Computability by monadic second-order logic
• scientific article; zbMATH DE number 1191231 (Why is no real title available?)
• Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates

This page was built for publication: A Kleene characterization of computability

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