๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A polynomial time algorithm for the local testability problem of deterministic finite automata

โœ Scribed by Kim, S.M.; McNaughton, R.; McCloskey, R.

Book ID
119773266
Publisher
IEEE
Year
1991
Tongue
English
Weight
760 KB
Volume
40
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Polynomial-time Algorithm for the Bist
A Polynomial-time Algorithm for the Bistable Roommates Problem
โœ Jay Sethuraman; Chung-Piaw Teo ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 127 KB

In a recent paper, Weems introduced the bistable matching problem, and asked if a polynomial-time algorithm exists to decide the feasibility of the bistable roommates problem. We resolve this question in the affirmative using linear programming. In addition, we show that several (old and new) result