A SYMBOLIC CALCULUS OF REGULAR EXPRESSIONS
スポンサーリンク
概要
- 論文の詳細を見る
To implement Ginzburg's equality check procedure for regular expressions by using personal computers, we propose a new and more efficient axiom system consisting of an axiom and inference rules concerning a new relational symbol $ \subset $ in addition to a part of Salomaa's axiom system.
- Research Association of Statistical Sciencesの論文
- 1987-03-00
Research Association of Statistical Sciences | 論文
- CLUSTERING BY A FUZZY METRIC : APPLICATIONS TO THE CLUSTER-MEDIAN PROBLEM
- A FAMILY OF REGRESSION MODELS HAVING PARTIALLY ADDITIVE AND MULTIPLICATIVE COVARIATE STRUCTURE
- AN OPTIMAL STOPPING PROBLEM ON TREE
- ON THE ORDERS OF MAX-MIN FUNCTIONALS
- TREE EXPRESSIONS AND THEIR PRODUCT FORMULA