BZPEER
More

Discover

About BZPEERSearchGraph

Research tools

HomeCollectionsResearchCollaborationPublish

Network

ExpertsCommunities

Opportunities

Listings

Account

Log inCreate account
Log inCreate account

On the transition reduction problem for finite automata

preprint2013arXivOpen access
el Houcein el AbdalaouiMohamed DahmouneDjelloul Ziadi
math.COFormal Languages and Automata Theory
Read originalOpen PDFOpen graphSave paperReviewsDiscussion

Abstract

We are interested in the problem of transition reduction of nondeterministic automata. We present some results on the reduction of the automata recognizing the language L(En)L(E_n) denoted by the regular expression En=(1+ε)...(2+ε)...(3+ε)...(n+ε)E_n=(1+\varepsilon)... (2+\varepsilon)... (3+\varepsilon)... (n+\varepsilon). These results can be used in the general case of the transition reduction problem.

Connections

Open full explorer

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite
Log in to review

No reviews yet.

Discussion 0

Add a commentWrite
Log in to comment

No comments yet.