Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language R with R 1 &unknown;R&unknown;R 2 for given regular languages R 1 ,R 2

Author： Hashiguchi K.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.289, Iss.1, 2002-10, pp. : 853-859

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Theory Extension in ACL2(r)

By Gamboa R.   Cowles J.  

Journal of Automated Reasoning, Vol. 38, Iss. 4, 2007-05 ,pp. : 273-301

Springer Publishing Company

Access to resources Recommend Favorite

e-R

By Ebert C.  

Annals of Software Engineering, Vol. 14, Iss. 1-4, 2002-12 ,pp. : 73-91

Springer Publishing Company

Access to resources Recommend Favorite

Risk Management Beyond VaR 1

By Rowe David M.  

EDPACS, Vol. 48, Iss. 1, 2013-01 ,pp. : 1-27

Taylor & Francis Ltd

Access to resources Recommend Favorite

DNA Compression Algorithm Based on R 2 Techniques

By Hossein Syed Mahamud   Mohapatra Pradeep Kumar Das   De Debashis  

Journal of Bioinformatics and Intelligent Control, Vol. 1, Iss. 2, 2012-12 ,pp. : 183-188

American Scientific Publishers

Access to resources Recommend Favorite

Augmenting the Rigidity of a Graph in R 2

By García A.   Tejel J.  

Algorithmica, Vol. 59, Iss. 2, 2011-02 ,pp. : 145-168

Springer Publishing Company

Access to resources Recommend Favorite