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

六边形

填满

On the Hierarchy of Block Deterministic Languagesn, and that the proof given by Han and Wood of a proper hierarchy in .-block deterministic languages based on this result is erroneous. Despite these results, we show by giving a parameterized family that there is a proper hierarchy in .-block deterministic regular languages.

MAL

On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphismorphism), such as NFAs having a unique initial states and a bounded output degree. Finally, we prove that for these interesting subclasses of NFAs, moving into the Metropolis Markov chain can be done in polynomial time. Promising experimental results constitute a practical contribution.

用手捏

扔掉掐死你

Frenetic

cipher

hardheaded

majestic

Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchres. In this paper, given a complete nondeterministic FSM, we propose a method for deriving a corresponding finite automaton such that the set of all homing (or distinguishing) sequences coincides with the set of all synchronizing sequences of the derived automaton.

Excise

Subword Metrics for Infinite Words [.], here we consider two different refinements of the Cantor-space, given by measuring common factors, and common factors occurring infinitely often. In particular we investigate the relation of these topologies to the sets of infinite words definable by finite automata, that is, to regular .-languages.