Sciweavers

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

8

DLT
2008

favoriteEmaildiscussreport

84views Theoretical Computer Science» more DLT 2008»

General Algorithms for Testing the Ambiguity of Finite Automata

13 years 6 months ago

General Algorithms for Testing the Ambiguity of Finite Automata

Download www.cs.nyu.edu

Cyril Allauzen, Mehryar Mohri, Ashish Rastogi

Real-time Traffic

DLT 2008 | Theoretical Computer Science |

claim paper

Related Content

» Testing the Equivalence of Regular Languages

» On the Complexity of Intersecting Finite State Automata

» Simpler and More General Minimization for Weighted FiniteState Automata

» Compiling Regular Formalisms with Rule Features into FiniteState Automata

» Antichain Algorithms for Finite Automata

» The Inclusion Problem for Regular Expressions

» A New Distance Algorithm and Its Application to General ForceClosure Test

» Faster Generalized LR Parsing

» Learnability of Probabilistic Automata via Oracles

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	DLT
Authors	Cyril Allauzen, Mehryar Mohri, Ashish Rastogi

Comments (0)