期刊文献+

LR(k)项集的性质与构造 被引量:6

On the Properties and Construction of the  LR (k) Item Set
下载PDF
导出
摘要 引入符号串的k-前缀,给出LR(k)项集Ik(α)及其基本集Bk(α)的定义,研究了Ik(α)的性质与相互关系,在此基础上构造了有限自动机Mk(A→λ,φ),进而证明了{αφ|(A→λ,φ)∈Ik(α)}是正规集,并给出了Ik(α)的构造。 The k prefix of a symbol string is first introduced and the definitions of the  LR (k) item set I k(α) and its basic set B k(α) is given. Some properties of I k(α) are studied. A deterministic finite automaton M k(A→λ, φ) is constructed. Last, the construction of I k(α) is given.
作者 韩光辉
出处 《武汉汽车工业大学学报》 CAS 1998年第4期84-87,共4页
关键词 有限自动机 符号串 自动机 K-前缀  LR (k) grammar  LR (k) item set finite automaton
  • 相关文献

参考文献1

  • 1唐稚松.LR(K)的语法分解与FPL程序的优化[J]数学学报,1978(01).

同被引文献18

  • 1韩光辉.有限自动机的最小化理论[J].江汉大学学报(自然科学版),2005,33(4):14-16. 被引量:6
  • 2[1]BergadanoF,VarricchioS.Learning Behaviors of Automata Multiplicity and Equivalence Queries[J].SLAMJ Comput,1999,25:6-12.
  • 3[2]Amos Beimel,Francesco Bergadano,Nader H Bshouty,et al.Learning Functions Represented as Multiplicity Automata[J].J ACM.2002,47(5):506-512.
  • 4[5]Einspahr K L,Mehta S K,Seth S C.A synthesis for Testability Scheme for Finite State Machines Using Clock Control[J].IEEE Transactions on Computer-Aided Design,1999,18(12):1 780-1 792.
  • 5[9]Ginsburg S.An Introduction to Mathematical Machine Theory[M].Reading:Addison-Wesley Publishing Company,Inc,1962.
  • 6Shannon C E,McCarthy J.Automata studies[M].Princeton:Princeton University Press,1956.
  • 7Rabin M O,Scott D.Finite automata and their decision problems[J].IBM J Res Develop,1959,3:114-125.
  • 8Chomsky N.On certain formal properties of grammars[J].Information and Control,1959,2:137-167.
  • 9Hopcroft J E,Ullman J D.Introduction to automata theory[M].Reading:Languages and Computation,Addison-Wesley,1979.
  • 10Bergadano F,Varricchio S.Learning behaviors of automata multiplicity and equivalence queries [J].SLAMJ Comput,1999,25:6-12.

引证文献6

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部