Titlebook: Implementation and Application of Automata; 20th International C Frank Drewes Conference proceedings 2015 Springer International Publishing

維持

Heresy

More on Deterministic and Nondeterministic Finite Cover Automatational complexity perspective. An important contribution to the theory of finite languages are the deterministic and the recently introduced nondeterministic finite . automata (DFCAs and NFCAs, respectively) as an alternative representation of finite languages by ordinary finite automata. We compare

熒光

On the Number of Synchronizing Colorings of Digraphslement set in such a way that outgoing edges of every vertex have different colors. Such a coloring corresponds naturally to an automaton. The road coloring theorem states that every primitive digraph has a synchronizing coloring..In the present paper we study how many synchronizing colorings can ex

outset

On the Uniform Random Generation of Non Deterministic Automata Up?to Isomorphism a Monte-Carlo approach to uniformly sample a NFA. Secondly, we show how to use the Metropolis-Hastings Algorithm to uniformly generate NFAs up?to isomorphism. Using labeling techniques, we show that in practice it is possible to move into the modified Markov Chain efficiently, allowing the random g

的是兄弟

admission

Subword Metrics for Infinite Wordsspace as a metric space, the Cantor-space. It turned out that for several purposes topologies other than the one of the Cantor-space are useful, e.g. for studying fragments of first-order logic over infinite words or for a topological characterisation of random infinite words..Continuing the work of

龍蝦

From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods methods yield relatively simple techniques to directly construct one-way automata that simulate the behavior of two-way automata. The approaches also offer conceptually uncomplicated alternative equivalence proofs of two-way automata and one-way automata, particularly in the deterministic case.

為現場

Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchrs) which are widely used in many applications. A homing sequence allows establishing the state of the given FSM after applying the sequence while a distinguishing sequence allows learning the state of the given FSM before the sequence is applied. On the other hand, other sequences, namely, synchroni

固執(zhí)點好

使隔離