找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Automata, Languages and Programming; 29th International C Peter Widmayer,Stephan Eidenbenz,Matthew Hennessy Conference proceedings 2002 Spr

[复制链接]
查看: 51750|回复: 66
发表于 2025-3-21 18:40:31 | 显示全部楼层 |阅读模式
期刊全称Automata, Languages and Programming
期刊简称29th International C
影响因子2023Peter Widmayer,Stephan Eidenbenz,Matthew Hennessy
视频video
发行地址Includes supplementary material:
学科分类Lecture Notes in Computer Science
图书封面Titlebook: Automata, Languages and Programming; 29th International C Peter Widmayer,Stephan Eidenbenz,Matthew Hennessy Conference proceedings 2002 Spr
Pindex Conference proceedings 2002
The information of publication is updating

书目名称Automata, Languages and Programming影响因子(影响力)




书目名称Automata, Languages and Programming影响因子(影响力)学科排名




书目名称Automata, Languages and Programming网络公开度




书目名称Automata, Languages and Programming网络公开度学科排名




书目名称Automata, Languages and Programming被引频次




书目名称Automata, Languages and Programming被引频次学科排名




书目名称Automata, Languages and Programming年度引用




书目名称Automata, Languages and Programming年度引用学科排名




书目名称Automata, Languages and Programming读者反馈




书目名称Automata, Languages and Programming读者反馈学科排名




单选投票, 共有 1 人参与投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:03:21 | 显示全部楼层
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166194.jpg
发表于 2025-3-22 04:08:13 | 显示全部楼层
Gesundheitsberichterstattung in DeutschlandThe notion of . in mathematical structures is a powerful tool in many branches of mathematics. The talk presents an application of this notion to programming language theory.
发表于 2025-3-22 06:44:45 | 显示全部楼层
U. Laaser,P. Wolters,F. X. KaufmannIn this paper we consider the intersection-nonemptiness problem for languages given by regular expression without binary +. We prove that for regular expressions of star height 2 this problem is .-complete and it is .-complete for regular expressions of star height at most 1.
发表于 2025-3-22 10:37:50 | 显示全部楼层
发表于 2025-3-22 15:45:51 | 显示全部楼层
Equivariant Syntax and SemanticsThe notion of . in mathematical structures is a powerful tool in many branches of mathematics. The talk presents an application of this notion to programming language theory.
发表于 2025-3-22 20:24:00 | 显示全部楼层
Intersection of Regular Languages and Star HierarchyIn this paper we consider the intersection-nonemptiness problem for languages given by regular expression without binary +. We prove that for regular expressions of star height 2 this problem is .-complete and it is .-complete for regular expressions of star height at most 1.
发表于 2025-3-22 23:16:59 | 显示全部楼层
发表于 2025-3-23 03:35:09 | 显示全部楼层
发表于 2025-3-23 09:32:31 | 显示全部楼层
Local and Global Methods in Data Mining: Basic Techniques and Open ProblemsData mining research can be divided into global approaches, which try to model the whole data, and local methods, which try to find useful patterns occurring in the data. We discuss briefly some simple local and global techniques, review two attempts at combining the approaches, and list open problems with an algorithmic flavor.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-13 11:57
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表