Titlebook: Implementation and Application of Automata; 5th International Co Shen Yu,Andrei Păun Conference proceedings 2001 Springer-Verlag Berlin Hei

显示全部楼层 · 发表于 2025-3-26 21:52:33

Generalizing the Discrete Timed Automatonta augmented with various data structures. We give examples of such data structures and exhibit some new properties of discrete timed automata that can be verified. We also briefly consider reachability in discrete timed automata operating in parallel.

显示全部楼层 · 发表于 2025-3-27 02:47:43

显示全部楼层 · 发表于 2025-3-27 05:48:10

显示全部楼层 · 发表于 2025-3-27 10:27:28

显示全部楼层 · 发表于 2025-3-27 17:37:54

显示全部楼层 · 发表于 2025-3-27 18:43:20

显示全部楼层 · 发表于 2025-3-28 00:04:50

显示全部楼层 · 发表于 2025-3-28 03:57:01

显示全部楼层 · 发表于 2025-3-28 08:21:21

Automata for Pro-V Topologiesogies (including the profinite one), of a rational language given by a finite automaton. In this paper we show that these algorithms can be obtained by an automata theoretic approach by using a result of Pin and Reutenauer. We also analyze precisely the complexity of these algorithms.

显示全部楼层 · 发表于 2025-3-28 12:28:37

		自动登录	找回密码
密码			To register

关于派博传思			派博传思旗下网站			友情链接
派博传思介绍	公司地理位置	论文服务流程	影响因子官网	吾爱论文网	大讲堂	北京大学	Oxford Uni.	Harvard Uni.
发展历史沿革	期刊点评	投稿经验总结	SCIENCEGARD	IMPACTFACTOR	派博系数	清华大学	Yale Uni.	Stanford Uni.
\|Archiver\|手机版\|小黑屋\| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-17 10:55
Copyright © 2001-2015 派博传思京公网安备110108008328 版权所有 All rights reserved