Titlebook: Implementation and Application of Automata; 22nd International C Arnaud Carayol,Cyril Nicaud Conference proceedings 2017 Springer Internati

發(fā)牢騷

Henning Fernau,Lakshmanan Kuppusamy,Indhumathi Raman

V切開(kāi)

Nathana?l Fijalkow,Hugo Gimbert,Edon Kelmendi,Denis Kuperberg

心神不寧

On the Complexity of Determinizing Monitors,l in size with respect to the original monitor. When monitors are described as CCS-like processes, this doubly-exponential bound is optimal. When (deterministic) monitors are described as finite automata (as their LTS), then they can be exponentially more succinct than their CCS process form.

不出名

諷刺滑稽戲劇

iodides

PRISE

Complexity of Proper Prefix-Convex Regular Languages,deal, prefix-closed, and prefix-free languages, which were studied elsewhere. Here we concentrate on prefix-convex languages that do not belong to any one of these classes; we call such languages .. We exhibit most complex proper prefix-convex languages, which meet the bounds for the size of the syn

期滿

Equivalence of Probabilistic ,-Calculus and p-Automata, .-calculus .-calculus and p-automata (parity alternating Markov chain automata) have an equally strong connection. Namely, for every .-calculus formula we can construct a p-automaton that accepts exactly those Markov chains that satisfy the formula. For every p-automaton we can construct a .-calcul

地殼

Complexity of Bifix-Free Regular Languages,lar languages. We show that there exist universal bifix-free languages that meet all the bounds for the state complexity of basic operations (Boolean operations, product, star, and reversal). This is in contrast with suffix-free languages, where it is known that there does not exist such languages.

Canary