Kleene, Rabin, and Scott Are Available

DOI10.1007/978-3-642-15375-4_32zbMATH Open1287.68135OpenAlexW1880689432MaRDI QIDQ3584949FDOQ3584949

Authors: Jochen Hoenicke, Roland Meyer, Ernst-Rüdiger Olderog 

Publication date: 31 August 2010

Published in: CONCUR 2010 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15375-4_32

Recommendations

• Dijkstra, Floyd and Warshall meet Kleene
• scientific article; zbMATH DE number 4039338
• Kleene revisited by Suschkewitsch
• Computability in structures representing a Scott set
• Scott's problem for Proper Scott sets
• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
• Kleene algebras are almost universal
• scientific article; zbMATH DE number 5485222
• The Mathematical Work of S.C.Kleene
• Turing incomparability in Scott sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (3)

• The algebraic theory of Parikh automata
• What's decidable about availability languages?
• Model-Checking Counting Temporal Logics on Flat Structures

This page was built for publication: Kleene, Rabin, and Scott Are Available

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