Reachability Problems  15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings /  [electronic resource] : 
edited by Paul C. Bell, Patrick Totzke, Igor Potapov. 
 - 1st ed. 2021. 
 - XVIII, 165 p. 16 illus., 6 illus. in color.  online resource. 
 - Theoretical Computer Science and General Issues,  13035  2512-2029 ; .
 - Theoretical Computer Science and General Issues,  13035 .
<br/><br/>Invited Papers -- Quantitative vs. Weighted Automata -- Theorem Proving Using Clausal Resolution: From Past to Present -- Population Protocols: Beyond Runtime Analysis -- Recent Advances on Reachability Problems for Valence Systems (Invited Talk) -- Regular Papers -- Improvements in Unfolding of Colored Petri Nets -- Reachability of weakly nonlinear systems using Carleman linearization -- Continued Fraction approach to Gauss-Reduction theory -- Absent Subsequences in Words -- Minimal Number of Calls in Propositional Protocols -- Reachability Is NP-Complete Even for the Simplest Neural Networks.-. 
<br/><br/> Chapter 'Recent Advances on Reachability Problems for Valence Systems' is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com. 
<br/><br/><label>ISBN: </label>9783030897161 
<br/><br/><label>Standard No.: </label>10.1007/978-3-030-89716-1  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer science.<br/>Artificial intelligence.<br/>Software engineering.<br/>Computer engineering.<br/>Computer networks .<br/>Theory of Computation.<br/>Artificial Intelligence.<br/>Software Engineering.<br/>Computer Engineering and Networks.
<br/><br/><label>LC Class. No.: </label>QA75.5-76.95 
<br/><br/><label>Dewey Class. No.: </label>004.0151