𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds on the size of sweeping automata

✍ Scribed by Michael Sipser

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
478 KB
Volume
21
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Lower bounds on size and independence in
Lower bounds on size and independence inK4-free graphs
✍ Fraughnaugh, Kathryn L.; Locke, Stephen C. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 131 KB πŸ‘ 1 views

We investigate lower bounds on the size of K 4 -free graphs. For several ranges of independence relative to order and for graphs with maximum degree 3 and 4, we find sharp lower bounds. We also evaluate Ramsey-type numbers over the classes of graphs with maximum degree 3 and with maximum degree 4.

New lower bounds for the size of edge ch
New lower bounds for the size of edge chromatic critical graphs
✍ Yue Zhao πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 108 KB πŸ‘ 1 views

## Abstract In this paper, by applying the discharging method, we obtain new lower bounds for the size of edge chromatic critical graphs for small maximum degree Ξ”. Β© 2004 Wiley Periodicals, Inc. J Graph Theory 46: 81–92, 2004

Lower bounds estimation of factor-coveri
Lower bounds estimation of factor-covering design sizes
✍ Nobuhiko Ido; Tohru Kikuno πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 115 KB

## Abstract Factor‐covering designs have been studied with the aim of making efficient suites of test cases for software testing. One of the major concerns in these studies is the construction of factor‐covering designs of smaller sizes. In this paper, we propose a method of estimating the lower bo