110
Voted
RP
2015
Springer
10 years 1 months ago
2015
Springer
For any left-linear context-sensitive term rewrite system and any regular language of ground terms I, we build a finite tree automaton that recognizes a superset of the descendant...
113
click to vote
RP
2015
Springer
10 years 1 months ago
2015
Springer
Abstract. We consider probabilistic automata over finite words. Such an automaton defines the language consisting of the set of words accepted with probability greater than a giv...
114
click to vote
RP
2015
Springer
10 years 1 months ago
2015
Springer
ander Malkis. MultithreadedCartesian Abstract Interpretation of Multithreaded Recursive Programs is Polynomial ● Masaya Shimakawa, Shigeki Hagihara and Nao...
129
click to vote
RP
2015
Springer
10 years 1 months ago
2015
Springer
Abstract. Interrupt Timed Automata (ITA) form a subclass of stopwatch automata where reachability and some variants of timed model checking are decidable even in presence of parame...
551
click to vote
ROMAN
2015
IEEE
10 years 1 months ago
2015
IEEE
— In our experiment, two autonomously moving costumed robots visit 256 offices during a ‘reverse’ trick-ortreating task close to Halloween. Our behavioral data supports the i...