Titlebook: Reachability Problems; 12th International C Igor Potapov,Pierre-Alain Reynier Conference proceedings 2018 Springer Nature Switzerland AG 20

遭遇

印第安人

Generalized Tag Systems, reductions when proving universality/undecidability results. They have been used to prove such results for the smallest universal Turing machines, the elementary cellular automata Rule 110, for simple instances of the Post correspondence problem and related problems on simple matrix semi-groups, an

gregarious

,Certain Query Answering on Compressed String Patterns: From Streams to?Hyperstreams,el systems of multiple streams with references to others, called hyperstreams more recently. In order to capture regular path queries on strings, we consider nondeterministic finite automata (.s) for query definition. It turns out that C. for Boolean . queries is equivalent to regular string pattern

SOB

路標(biāo)

Qualitative Reachability for Open Interval Markov Chains,ues. While the standard formulation of interval Markov chains features closed intervals, previous work has considered also open interval Markov chains, in which the intervals can also be open or half-open. In this paper we focus on qualitative reachability problems for open interval Markov chains, w

BRUNT

Endearing

Corporeal

EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets,eachability games, namely for a modification of countdown games that were shown EXPTIME-complete by Jurdzinski, Sproston, Laroussinie (LMCS 2008); in our modification the initial counter value is not given but is freely chosen by the first player.

doxazosin

Sad570