Generalizing input-driven languages: theoretical and practical benefits.
Computer Science Review(2018)
摘要
Regular languages (RL) are the simplest family in Chomsky’s hierarchy. Thanks to their simplicity they enjoy various nice algebraic and logic properties that have been successfully exploited in many application fields. Practically all of their related problems are decidable, so that they support automatic verification algorithms. Also, they can be recognized in real-time.
更多查看译文
关键词
Regular languages,Context-free languages,Input-driven languages,Visibly pushdown languages,Operator-precedence languages,Monadic second order logic,Closure properties,Decidability and automatic verification
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络