位置：成果数据库 > 会议 > 会议详情页
Towards practical computable functions on context-free languages
  • 所属机构名称：中国科学院软件研究所
  • 成果类型：会议
  • 相关项目：基于文法的系统的模型和检验问题研究
同会议论文项目
基于文法的系统的模型和检验问题研究
期刊论文 9 会议论文 9
同项目会议论文
A systematic framework for grammar testing
On the efficiency of spiking neural P systems
On trace languages generated by spiking neural P systems
Computing along the axon
Efficient type checking for a subclass of regular expression types
On trace languages generated by (small) spiking neural P systems
Inclusion test algorithms for one-unambiguous regular expressions
Spiking neural P systems with extended rules