Solving Complex Problems Efficiently with Adaptive Automata
暂无分享,去创建一个
[1] Kenneth Slonneger,et al. Formal syntax and semantics of programming languages - a laboratory based approach , 1995 .
[2] JOÃO JOSÉ NETO,et al. SYNCHRONIZED STATECHARTS FOR REACTIVE SYSTEMS , 1998 .
[3] John N. Shutt,et al. Self-Modifying Finite Automata - Basic Definitions and Results , 1995 .
[4] Henning Christiansen,et al. A survey of adaptable grammars , 1990, SIGP.
[5] Christos H. Papadimitriou,et al. Elements of the Theory of Computation , 1997, SIGA.
[6] John N. Shutt. Self-Modifying Finite Automata - Power and Limitations , 1995 .
[7] João José Neto. Adaptive automata for context-dependent languages , 1994, SIGP.
[8] Boris Burshteyn,et al. Generation and recognition of formal languages by modifiable grammars , 1990, SIGP.
[9] Frank G. Pagan,et al. Formal Specification of Programming Languages: A Panoramic Primer , 1981 .
[10] John N. Shutt. Recursive Adaptable Grammars , 1999 .