Sciweavers

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

13

LATA
2010
Springer

favoriteEmaildiscussreport

163views Artificial Intelligence» more LATA 2010»

Some Minimality Results on Biresidual and Biseparable Automata

13 years 10 months ago

Some Minimality Results on Biresidual and Biseparable Automata

Download cs.ioc.ee

Hellis Tamm

Real-time Traffic

Automata Theory | LATA 2010 |

claim paper

Related Content

» Testing the Equivalence of Regular Languages

» Compilation Methods of Minimal Acyclic FiniteState Automata for Large Dictionaries

» Logic Meets Algebra the Case of Regular Languages

» Methods and Applications of MAX Linear Algebra

» Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature

» Fsimac a fault simulator for asynchronous sequential circuits

Post Info
More Details (n/a)

Added	09 Jul 2010
Updated	09 Jul 2010
Type	Conference
Year	2010
Where	LATA
Authors	Hellis Tamm

Comments (0)