找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: angiotensin-I
31#
發(fā)表于 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
32#
發(fā)表于 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.
33#
發(fā)表于 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
34#
發(fā)表于 2025-3-27 09:59:07 | 只看該作者
35#
發(fā)表于 2025-3-27 14:17:47 | 只看該作者
36#
發(fā)表于 2025-3-27 18:40:59 | 只看該作者
37#
發(fā)表于 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.
38#
發(fā)表于 2025-3-28 05:53:42 | 只看該作者
https://doi.org/10.1007/3-540-08342-1Automatentheorie; Languages; Semiotik; automata; calculus; complexity; data structures; optimization; progra
39#
發(fā)表于 2025-3-28 08:06:52 | 只看該作者
40#
發(fā)表于 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?
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-9 04:22
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
嘉兴市| 噶尔县| 扬州市| 闽清县| 阳西县| 合山市| 克什克腾旗| 河间市| 从江县| 七台河市| 宜宾市| 天门市| 鹰潭市| 建平县| 桓台县| 巴林右旗| 阜南县| 长子县| 望奎县| 昂仁县| 太湖县| 修文县| 乌兰浩特市| 南阳市| 吉林市| 清水县| 永寿县| 江陵县| 沅陵县| 惠安县| 奎屯市| 武隆县| 河北区| 开封县| 安康市| 藁城市| 白河县| 册亨县| 竹北市| 凤庆县| 楚雄市|