CORD
发表于 2025-3-26 23:35:41
Constructing Infinite Words of Intermediate Complexity
inferno
发表于 2025-3-27 03:01:48
http://reply.papertrans.cn/28/2703/270244/270244_32.png
Finasteride
发表于 2025-3-27 05:46:30
Zur Geschichte des Hölderlinschen NachlassesWe associate a modal operator with each language belonging to a given class of regular languages and use the (reverse) wreath product of monoids with distinguished generators to characterize the expressive power of the resulting logic.
conduct
发表于 2025-3-27 11:14:43
http://reply.papertrans.cn/28/2703/270244/270244_34.png
倔强一点
发表于 2025-3-27 16:27:57
http://reply.papertrans.cn/28/2703/270244/270244_35.png
开始从未
发表于 2025-3-27 18:06:26
http://reply.papertrans.cn/28/2703/270244/270244_36.png
Cognizance
发表于 2025-3-28 01:50:02
Höllen-Inszenierung „Wrestling“We improve the known bounds on the number of pairwise non-isomorphic minimal deterministic finite automata (DFAs) on . states which accept finite languages. The lower bound constructions are iterative approaches which yield recurrence relations.
清洗
发表于 2025-3-28 02:56:19
http://reply.papertrans.cn/28/2703/270244/270244_38.png
Exterior
发表于 2025-3-28 07:37:47
Finite Automata Models of Quantized Systems: Conceptual Status and OutlookSince Edward Moore, finite automata theory has been inspired by physics, in particular by quantum complementarity. We review automaton complementarity, reversible automata and the connections to generalized urn models. Recent developments in quantum information theory may have appropriate formalizations in the automaton context.
警告
发表于 2025-3-28 12:50:04
Automata on Linear OrderingsWe consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce automata and rational expressions for words on linear orderings.