A Kleene characterization of computability
From MaRDI portal
Publication:845916
DOI10.1016/j.ipl.2006.09.003zbMath1185.68330MaRDI QIDQ845916
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
68Q45: Formal languages and automata
Related Items
Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates, Computability by monadic second-order logic
Cites Work