六边形
发表于 2025-3-23 13:26:56
http://reply.papertrans.cn/47/4626/462536/462536_11.png
填满
发表于 2025-3-23 17:40:56
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
发表于 2025-3-23 20:34:05
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.
用手捏
发表于 2025-3-24 01:38:17
http://reply.papertrans.cn/47/4626/462536/462536_14.png
扔掉掐死你
发表于 2025-3-24 04:52:22
http://reply.papertrans.cn/47/4626/462536/462536_15.png
Frenetic
发表于 2025-3-24 09:03:26
http://reply.papertrans.cn/47/4626/462536/462536_16.png
cipher
发表于 2025-3-24 10:55:38
http://reply.papertrans.cn/47/4626/462536/462536_17.png
hardheaded
发表于 2025-3-24 15:48:00
http://reply.papertrans.cn/47/4626/462536/462536_18.png
majestic
发表于 2025-3-24 19:25:31
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
发表于 2025-3-25 01:08:29
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.