找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Automata, Languages and Programming; Fourth Colloquium, U Arto Salomaa,Magnus Steinby Conference proceedings 1977 Springer-Verlag Berlin He

[复制链接]
楼主: angiotensin-I
发表于 2025-3-27 00:49:24 | 显示全部楼层
https://doi.org/10.1007/b138054xtsensitivity of a grammar is defined on its derivations, and it is determined by the maximal length of the strings of ancestors of any symbol occurring at any position of the derived strings. A total recursive function f bounds the (right-) contextsensitivity function of grammar G, if for every ter
发表于 2025-3-27 03:54:06 | 显示全部楼层
https://doi.org/10.1007/978-3-540-73410-9its main applications: we showed that two-level parsing by means of coarse structures can simplify the parsing process and that the concept of coarse structures can advantageously be used for syntax error recovery using global rather than local context of the error position.
发表于 2025-3-27 06:48:33 | 显示全部楼层
https://doi.org/10.1007/978-3-540-73410-9ethods recently introduced in graph theory. A class of pattern matching and replacement rules for graphs is specified, such that applications of rules in the class can readily be programmed as rapid transformations of record structures. When transformations of record structures are formalized as app
发表于 2025-3-27 09:59:07 | 显示全部楼层
发表于 2025-3-27 14:17:47 | 显示全部楼层
发表于 2025-3-27 18:40:59 | 显示全部楼层
发表于 2025-3-28 00:42:17 | 显示全部楼层
Parsing and syntactic error recovery for context-free grammars by means of coarse structures,its main applications: we showed that two-level parsing by means of coarse structures can simplify the parsing process and that the concept of coarse structures can advantageously be used for syntax error recovery using global rather than local context of the error position.
发表于 2025-3-28 05:53:42 | 显示全部楼层
https://doi.org/10.1007/3-540-08342-1Automatentheorie; Languages; Semiotik; automata; calculus; complexity; data structures; optimization; progra
发表于 2025-3-28 08:06:52 | 显示全部楼层
发表于 2025-3-28 11:36:14 | 显示全部楼层
https://doi.org/10.1007/978-3-540-73410-9The sequence equivalence problem for DOL systems is shown to be decidable. In an algebraic formulation the sequence equivalence problem for DOL systems can be stated as follows: Given homomorphisms h. and h. on a free monoid Σ* and a word σ from Σ*, is h.(σ)=h.(σ) for all n>0?
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-10 01:11
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表