Titlebook: New Trends in Formal Languages; Control, Cooperation Gheorghe Păun,Arto Salomaa Book 1997 Springer-Verlag Berlin Heidelberg 1997 Formale Sp

显示全部楼层 · 发表于 2025-3-21 19:43:05

书目名称New Trends in Formal Languages影响因子(影响力)

书目名称New Trends in Formal Languages影响因子(影响力)学科排名

书目名称New Trends in Formal Languages网络公开度

书目名称New Trends in Formal Languages网络公开度学科排名

书目名称New Trends in Formal Languages被引频次

书目名称New Trends in Formal Languages被引频次学科排名

书目名称New Trends in Formal Languages年度引用

书目名称New Trends in Formal Languages年度引用学科排名

书目名称New Trends in Formal Languages读者反馈

书目名称New Trends in Formal Languages读者反馈学科排名

显示全部楼层 · 发表于 2025-3-21 22:44:42

Conditional context-free languages of finite index,onograph on regulated rewriting. Moreover, we show that conditional context-free languages with context-free conditions of finite index are more powerful than conditional context-free languages with regular conditions of finite index. Furthermore, we study the complexity of membership and non-emptin

显示全部楼层 · 发表于 2025-3-22 01:38:26

The accepting power of finite automata over groups,idered, in comparison with the non-abelian groups. We prove that this is due to the commutativity. Each language accepted by a finite automaton over an abelian group is actually a unordered vector language. Finally, deterministic finite automata over groups are investigated.

显示全部楼层 · 发表于 2025-3-22 06:15:19

显示全部楼层 · 发表于 2025-3-22 10:58:17

显示全部楼层 · 发表于 2025-3-22 13:14:23

On restarting automata with rewriting,writing systems on the other hand. The computation of a restarting automaton proceeds in cycles: in each cycle, a bounded substring of the input word is rewritten by a shorter string, and the computation restarts on the arising shorter word..We show a taxonomy of (sub)variants of these automata taki

显示全部楼层 · 发表于 2025-3-22 20:16:15

显示全部楼层 · 发表于 2025-3-22 22:47:53

显示全部楼层 · 发表于 2025-3-23 04:26:54

Grammatical inference of colonies,sed on presentation of positive and negative examples of strings is then described, together with an algorithm for extracting a colony from trained neural network. Some examples of the inference of colonies generating/accepting simple context-free languages illustrate the function of the architectur

显示全部楼层 · 发表于 2025-3-23 07:43:05

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

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