✦ LIBER ✦

[Lecture Notes in Computer Science] Algorithms and Computation Volume 762 || Separating exponentially ambiguous NFA from polynomially ambiguous NFA

✍ Scribed by Ng, K. W.; Raghavan, P.; Balasubramanian, N. V.; Chin, F. Y. L.

Book ID: 120306359
Publisher: Springer Berlin Heidelberg
Year: 1993
Weight: 465 KB
Category: Article
ISBN: 3540482334
DOI: 10.1007/3-540-57568-5_252

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] STAC

[Lecture Notes in Computer Science] STACS 2005 Volume 3404 || Minimizing NFA’s and Regular Expressions

✍ Diekert, Volker; Durand, Bruno 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg ⚖ 201 KB

[Lecture Notes in Computer Science] STAC

[Lecture Notes in Computer Science] STACS 2005 Volume 3404 || Minimizing NFA’s and Regular Expressions

✍ Diekert, Volker; Durand, Bruno 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg ⚖ 201 KB

[Lecture Notes in Computer Science] Impl

[Lecture Notes in Computer Science] Implementation and Application of Automata Volume 2608 || Dynamic Programming — NFA Simulation

✍ Champarnaud, Jean-Marc; Maurel, Denis 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg ⚖ 490 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 3827 || Separability with Outliers

✍ Deng, Xiaotie; Du, Ding-Zhu 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 473 KB

This Book Constitutes The Refereed Proceedings Of The 16th International Symposium On Algorithms And Computation, Isaac 2005, Held In Sanya, Hainan, China In December 2005. The 112 Revised Full Papers Presented Were Carefully Reviewed And Selected From 549 Submissions. The Papers Are Organized In To

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 762 || Multicommodity flows: A survey of recent research

✍ Ng, K. W.; Raghavan, P.; Balasubramanian, N. V.; Chin, F. Y. L. 📂 Article 📅 1993 🏛 Springer Berlin Heidelberg ⚖ 344 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 762 || Finding shortest non-crossing rectilinear paths in plane regions

✍ Ng, K. W.; Raghavan, P.; Balasubramanian, N. V.; Chin, F. Y. L. 📂 Article 📅 1993 🏛 Springer Berlin Heidelberg ⚖ 566 KB