A Kleene characterization of computability

DOI10.1016/j.ipl.2006.09.003zbMath1185.68330OpenAlexW2051522302MaRDI QIDQ845916

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)

Related Items

Computability by monadic second-order logic ⋮ Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates

Cites Work

• Unnamed Item
• Unnamed Item
• A note on morphic characterization of languages
• Abstract grammars based on transductions
• On characterizations of recursively enumerable languages
• Iterated a-NGSM maps and Γ systems
• Iteration of rational transductions