Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

26

IPL
2008

favoriteEmaildiscussreport

79views more IPL 2008»

On the efficient construction of quasi-reversible automata for reversible languages

13 years 11 months ago

On the efficient construction of quasi-reversible automata for reversible languages

Download users.dsic.upv.es

Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language represented by its minimal DFA. Our method runs in polynomial time respect to the size of the minimal DFA and improves a previous exponential method. Previous bound for the size of quasi-reversible automata is also reduced.

Pedro García, Manuel Vazquez de Parga, Dami

Real-time Traffic

IPL 2008 | Minimal Dfa | Quasi-reversible Automata | Reversible Language |

claim paper

Related Content

» Tabulation of Automata for TreeAdjoining Languages

» On Recognizable Stable Trace Languages

» Minimal CoverAutomata for Finite Languages

» Undoing the effects of action sequences

» Minimization Learning and Conformance Testing of Boolean Programs

» Efficient Inference through Cascades of Weighted Tree Transducers

» biXid a bidirectional transformation language for XML

» Highspeed regular expression matching engine using multicharacter NFA

» Small NFAs from Regular Expressions Some Experimental Results

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IPL
Authors	Pedro García, Manuel Vazquez de Parga, Damián López

Comments (0)