Sciweavers

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

21

DLT
2007

favoriteEmaildiscussreport

67views Theoretical Computer Science» more DLT 2007»

On Transition Minimality of Bideterministic Automata

14 years 10 days ago

On Transition Minimality of Bideterministic Automata

Download www.cs.ioc.ee

Hellis Tamm

Real-time Traffic

DLT 2007 | Theoretical Computer Science |

claim paper

Related Content

» A Coalgebraic Perspective on Minimization and Determinization

» Weighted Bisimulation in Linear Algebraic Form

» Synchronization of Some DFA

» Bisimulation Minimization of Tree Automata

» Inapproximability of Nondeterministic State and Transition Complexity Assuming PNP

» Medley of spirals from cyclic cellular automata

» Learning of EventRecording Automata

» Distributedcode generation from hybrid systems models for timedelayed multirate systems

» Model Checking Prioritized Timed Automata

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2007
Where	DLT
Authors	Hellis Tamm

Comments (0)